A tabu search algorithm for the site dependent vehicle routing problem with time windows

Citation
Jf. Cordeau et G. Laporte, A tabu search algorithm for the site dependent vehicle routing problem with time windows, INFOR, 39(3), 2001, pp. 292-298
Citations number
6
Categorie Soggetti
Engineering Mathematics
Journal title
INFOR
ISSN journal
03155986 → ACNP
Volume
39
Issue
3
Year of publication
2001
Pages
292 - 298
Database
ISI
SICI code
0315-5986(200108)39:3<292:ATSAFT>2.0.ZU;2-I
Abstract
This paper shows that the Site Dependent Vehicle Routing Problem (SDVRP) ca n be viewed as a special case of the Periodic VRP. A tabu search heuristic for the SDVRP and the SDVRP with Time Windows is outlined and tested on ran domly generated instances. In the case of the SDVRP for which benchmark res ults are available, the proposed method outperforms all previously publishe d algorithms.