The vehicle routing problem: An overview of exact and approximate algorithms
- 1 June 1992
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 59 (3) , 345-358
- https://doi.org/10.1016/0377-2217(92)90192-c
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A set‐partitioning‐based exact algorithm for the vehicle routing problemNetworks, 1989
- An exact algorithm for the asymmetrical capacitated vehicle routing problemNetworks, 1986
- Routing with time windows by column generationNetworks, 1984
- A generalized assignment heuristic for vehicle routingNetworks, 1981
- State‐space relaxation procedures for the computation of bounds to routing problemsNetworks, 1981
- Implementing vehicle routing algorithmsNetworks, 1977
- Some Simple Applications of the Travelling Salesman ProblemJournal of the Operational Research Society, 1975
- Computer Scheduling of Vehicles from One or More Depots to a Number of Delivery PointsJournal of the Operational Research Society, 1972
- Bases for Vehicle Fleet SchedulingJournal of the Operational Research Society, 1967
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962