Comparing descent heuristics and metaheuristics for the vehicle routing problem
- 1 April 2001
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 28 (4), 289-315
- https://doi.org/10.1016/s0305-0548(99)00101-x
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Routing problems: A bibliographyAnnals of Operations Research, 1995
- Solving real-life vehicle routing problems efficiently using tabu searchAnnals of Operations Research, 1993
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- Parallel iterative search methods for vehicle routing problemsNetworks, 1993
- A simulated annealing technique approach to the vehicle routing problem in the case of stochastic demandTransportation Planning and Technology, 1992
- Simulated annealing: An introductionStatistica Neerlandica, 1989
- Using simulated annealing to solve routing and location problemsNaval Research Logistics Quarterly, 1986
- Optimization by Simulated AnnealingScience, 1983
- Complexity of vehicle routing and scheduling problemsNetworks, 1981
- Problems in the Analysis of Survey Data, and a ProposalJournal of the American Statistical Association, 1963