A parallel implementation of the Tabu search heuristic for Vehicle Routing Problems with Time Window constraints

This paper describes a parallel Tabu search heuristic for the Vehicle Routing Problem with Time Windows. The parallel algorithm is synchronous and runs on a Multiple-Instruction Multiple-Data computer architecture. Parallelism is exploited by considering many different neighborhoods of the current solution, and by applying many modifications at once to the current solution. Computational results are reported on a standard set of test problems.