A multi-start local search algorithm for the vehicle routing problem with time windows
- 16 December 2004
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 159 (3), 586-605
- https://doi.org/10.1016/s0377-2217(03)00435-1
Abstract
No abstract availableThis publication has 30 references indexed in Scilit:
- Parallel simulated annealing for the vehicle routing problem with time windowsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A Fast Evolutionary Metaheuristic for the Vehicle Routing Problem with Time WindowsInternational Journal on Artificial Intelligence Tools, 2003
- A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time WindowsINFOR: Information Systems and Operational Research, 2003
- A unified tabu search heuristic for vehicle routing problems with time windowsJournal of the Operational Research Society, 2001
- A Heuristic for the Vehicle Routing Problem with Time WindowsJournal of Heuristics, 2001
- A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time WindowsINFORMS Journal on Computing, 1997
- Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time WindowsOperations Research, 1996
- Simulated annealing metaheuristics for the vehicle routing problem with time windowsAnnals of Operations Research, 1996
- New Insertion and Postoptimization Procedures for the Traveling Salesman ProblemOperations Research, 1992
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealingJournal of Computational Physics, 1990