A parallel tabu search heuristic for the vehicle routing problem with time windows
- 1 April 1997
- journal article
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 5 (2), 109-122
- https://doi.org/10.1016/s0968-090x(97)00005-3
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Probabilistic diversification and intensification in local search for vehicle routingJournal of Heuristics, 1995
- Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirementsOR Spectrum, 1995
- A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraintsComputers & Operations Research, 1994
- Massively parallel tabu search for the quadratic assignment problemAnnals of Operations Research, 1993
- Parallel iterative search methods for vehicle routing problemsNetworks, 1993
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windowsEuropean Journal of Operational Research, 1993
- Robust taboo search for the quadratic assignment problemParallel Computing, 1991
- Some efficient heuristic methods for the flow shop sequencing problemEuropean Journal of Operational Research, 1990
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problemAnnals of Operations Research, 1989
- Future paths for integer programming and links to artificial intelligenceComputers & Operations Research, 1986