Journal of the Operational Research Society

, Volume 52, Issue 8, pp 928–936 | Cite as

A unified tabu search heuristic for vehicle routing problems with time windows

Theoretical Paper

Abstract

This paper presents a unified tabu search heuristic for the vehicle routing problem with time windows and for two important generalizations: the periodic and the multi-depot vehicle routing problems with time windows. The major benefits of the approach are its speed, simplicity and flexibility. The performance of the heuristic is assessed by comparing it to alternative methods on benchmark instances of the vehicle routing problem with time windows. Computational experiments are also reported on new randomly generated instances for each of the two generalizations.

Keywords

vehicle routing problem periodic vehicle routing problem multi-depot vehicle routing problem time windows tabu search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Palgrave Publishers Ltd 2001

Authors and Affiliations

  1. 1.École des Hautes Études CommercialesMontréalCanada

Personalised recommendations