Hybrid metaheuristics for the clustered vehicle routing problem
DOI10.1016/j.cor.2014.10.019zbMath1348.90138arXiv1404.6696OpenAlexW2093698911MaRDI QIDQ337513
Thibaut Vidal, Anand Subramanian, Güneş Erdoğan, Maria Battarra
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.6696
shortest pathhybrid genetic algorithmiterated local searchclustered vehicle routinglarge neighborhoods
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (19)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A general heuristic for vehicle routing problems
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A simple and effective metaheuristic for the minimum latency problem
- An efficient transformation of the generalized vehicle routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- New mathematical models of the generalized vehicle routing problem and extensions
- Very large-scale vehicle routing: new test problems, algorithms, and results
- A unified solution framework for multi-attribute vehicle routing problems
- Implicit depot assignments and rotations in vehicle routing heuristics
- The Vehicle Routing Problem
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- Exact Algorithms for the Clustered Vehicle Routing Problem
This page was built for publication: Hybrid metaheuristics for the clustered vehicle routing problem