Heuristics for vehicle routing problems: sequence or set optimization?
From MaRDI portal
Publication:1722969
DOI10.1016/j.cor.2018.12.023zbMath1458.90144arXiv1803.06062OpenAlexW2963203862WikidataQ128655761 ScholiaQ128655761MaRDI QIDQ1722969
Thibaut Vidal, Tony Wauters, Túlio A. M. Toffolo
Publication date: 19 February 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.06062
integer programmingdynamic programmingmetaheuristicsvehicle routing problemlarge neighborhood searchdecision-set decompositions
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Related Items
A concise guide to existing and emerging vehicle routing problem variants ⋮ Fairer comparisons for travelling salesman problem solutions using hash functions ⋮ A simple and effective hybrid genetic search for the job sequencing and tool switching problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid algorithm for a class of vehicle routing problems
- Hybrid metaheuristics for the clustered vehicle routing problem
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A survey of very large-scale neighborhood search techniques
- Upper bounds on ATSP neighborhood size.
- A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem.
- The vehicle routing problem with service level constraints
- New benchmark instances for the capacitated vehicle routing problem
- Large multiple neighborhood search for the clustered vehicle-routing problem
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems
- Solution of real-world postman problems
- A unified solution framework for multi-attribute vehicle routing problems
- Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems
- Vehicle Routing
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Timing problems and algorithms: Time decisions for sequences of activities
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- An Improved Petal Heuristic for the Vehicle Routeing Problem
- Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Handbook of metaheuristics
