A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem
- 1 December 2010
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 37 (12), 2089-2105
- https://doi.org/10.1016/j.cor.2010.02.009
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- A general heuristic for vehicle routing problemsComputers & Operations Research, 2007
- Solving the vehicle routing problem with adaptive memory programming methodologyComputers & Operations Research, 2005
- Sequential search and its application to vehicle-routing problemsComputers & Operations Research, 2005
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- See the forest before the trees: fine-tuned learning and its application to the traveling salesman problemIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 1998
- A heuristic algorithm for the Asymmetric Capacitated Vehicle Routing ProblemEuropean Journal of Operational Research, 1996
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problemAnnals of Operations Research, 1993
- Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computationCommunications of the ACM, 1988
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Algorithms for Large-scale Travelling Salesman ProblemsJournal of the Operational Research Society, 1972