A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints

https://doi.org/10.1016/0305-0548(94)90073-6Get rights and content

Abstract

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.

References (19)

There are more references available in the full text version of this article.

Cited by (0)

Bruno-Laurent Garcia is currently a Ph.D. student at the Centre Universitaire des Sciences et Techniques, Université Blaise Pascal, Clermont Ferrand, France. The work described in this paper was done at the Centre de Recherche sur les Transports of Montreal University, as a part of his research project.

§

Jean-Marc Rousseau is vice-president of Giro Inc., a company located in Montreal that specializes in the development of vehicle routing and scheduling software. He is also Adjunct Professor at the Department of Computer Science and Operations Research of Montreal University, and at the Centre de Recherche sur les Transports. He received a Ph.D. degree in operations research from M.I.T. and has published many papers in international journals relating to transportation problems.

View full text