A TABU SEARCH HEURISTIC FOR THE MULTI-DEPOT VEHICLE-ROUTING PROBLEM

Authors
RENAUD J LAPORTE G BOCTOR FF
Citation
J. Renaud et al., A TABU SEARCH HEURISTIC FOR THE MULTI-DEPOT VEHICLE-ROUTING PROBLEM, Computers & operations research, 23(3), 1996, pp. 229-235
Citations number
34
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science","Computer Science Interdisciplinary Applications","Engineering, Industrial
Journal title
Computers & operations research → ACNP
ISSN journal
03050548
Volume
23
Issue
3
Year of publication
1996
Pages
229 - 235
Database
ISI
SICI code
0305-0548(1996)23:3<229:ATSHFT>2.0.ZU;2-O
Abstract
This article describes a tabu search algorithm for the multi-depot veh icle routing problem with capacity and route length restrictions. The algorithm is tested on a set of 23 benchmark instances. It is shown to outperform existing heuristics.