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

Authors
Cordeau, JF Laporte, G Mercier, A
Citation
Jf. Cordeau et al., A unified tabu search heuristic for vehicle routing problems with time windows, J OPER RES, 52(8), 2001, pp. 928-936
Citations number
30
Categorie Soggetti
Management,"Engineering Mathematics
Journal title
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
ISSN journal
01605682 → ACNP
Volume
52
Issue
8
Year of publication
2001
Pages
928 - 936
Database
ISI
SICI code
0160-5682(200108)52:8<928:AUTSHF>2.0.ZU;2-R
Abstract
This paper presents a unified tabu search heuristic for the vehicle routing problem with time windows and for two important generalizations: the perio dic and the multi-depot vehicle routing problems with time windows. The maj or benefits of the approach are its speed, simplicity and flexibility The p erformance of the heuristic is assessed by comparing it to alternative meth ods on benchmark instances of the vehicle routing problem with time windows . Computational experiments are also reported on new randomly generated ins tances for each of the two generalizations.