A TABU SEARCH HEURISTIC FOR PERIODIC AND MULTI-DEPOT VEHICLE-ROUTING PROBLEMS

Authors
CORDEAU JF GENDREAU M LAPORTE G
Citation
Jf. Cordeau et al., A TABU SEARCH HEURISTIC FOR PERIODIC AND MULTI-DEPOT VEHICLE-ROUTING PROBLEMS, Networks, 30(2), 1997, pp. 105-119
Citations number
43
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture
Journal title
Networks → ACNP
ISSN journal
00283045
Volume
30
Issue
2
Year of publication
1997
Pages
105 - 119
Database
ISI
SICI code
0028-3045(1997)30:2<105:ATSHFP>2.0.ZU;2-5
Abstract
We propose a tabu search heuristic capable of solving three well-known routing problems: the periodic vehicle routing problem, the periodic traveling salesman problem, and the multi-depot vehicle routing proble m. Computational experiments carried out on instances taken from the l iterature indicate that the proposed method outperforms existing heuri stics for all three problems. (C) 1997 John Wiley & Sons, Inc.