A PARALLEL IMPLEMENTATION OF THE TABU SEARCH HEURISTIC FOR VEHICLE-ROUTING PROBLEMS WITH TIME WINDOW CONSTRAINTS

Authors
GARCIA BL POTVIN JY ROUSSEAU JM
Citation
Bl. Garcia et al., A PARALLEL IMPLEMENTATION OF THE TABU SEARCH HEURISTIC FOR VEHICLE-ROUTING PROBLEMS WITH TIME WINDOW CONSTRAINTS, Computers & operations research, 21(9), 1994, pp. 1025-1033
Citations number
19
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science","Computer Science Interdisciplinary Applications","Engineering, Industrial
Journal title
Computers & operations research → ACNP
ISSN journal
03050548
Volume
21
Issue
9
Year of publication
1994
Pages
1025 - 1033
Database
ISI
SICI code
0305-0548(1994)21:9<1025:APIOTT>2.0.ZU;2-2
Abstract
This paper describes a parallel Tabu search heuristic for the Vehicle Routing Problem with Time Windows. The parallel algorithm is synchrono us and runs on a Multiple-Instruction Multiple-Data computer architect ure. Parallelism is exploited by considering many different neighborho ods of the current solution, and by applying many modifications at onc e to the current solution. Computational results are reported on a sta ndard set of test problems.