A unified exact method for solving different classes of vehicle routing problems
- 15 April 2008
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 120 (2), 347-380
- https://doi.org/10.1007/s10107-008-0218-9
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cutsMathematical Programming, 2007
- A column generation approach to the heterogeneous fleet vehicle routing problemComputers & Operations Research, 2007
- The multi-depot vehicle routing problem with inter-depot routesEuropean Journal of Operational Research, 2007
- The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problemComputers & Operations Research, 2006
- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing ProblemMathematical Programming, 2005
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow FormulationOperations Research, 2004
- 6. Metaheuristics for the Capacitated VRPPublished by Society for Industrial & Applied Mathematics (SIAM) ,2002
- 5. Classical Heuristics for the Capacitated VRPPublished by Society for Industrial & Applied Mathematics (SIAM) ,2002
- A tabu search heuristic for periodic and multi-depot vehicle routing problemsNetworks, 1997
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxationsMathematical Programming, 1981