Technical Note
Journal of the Operational Research Society (2004) 55, 542–546. doi:10.1057/palgrave.jors.2601707
Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
J-F Cordeau1, G Laporte1 and A Mercier2
- 1Canada Research Chair in Distribution Management, HEC Montréal, Canada
- 2GERAD, École Polytechnique de Montréal, Canada
Correspondence: J-F Cordeau, Canada Research Chair in Distribution Management, HEC Montréal, 3000, Chemin de la Cote-Sainte-Catherine, Montréal, QC, Canada H3T 2A7.E-mail: jean-francois.cordeau@hec.ca
Received September 2003; Accepted November 2003.
Abstract
This note introduces a refinement to a previously proposed tabu search algorithm for vehicle routing problems with time windows. This refinement yields new best known solutions on a set of benchmark instances of the multi-depot, the periodic and the site-dependent vehicle routing problems with time windows.
Keywords:
tabu search, multi-depot, periodic, site-dependent vehicle routing, time windows
MORE ARTICLES LIKE THIS
These links to content published by Palgrave Macmillan are automatically generated.
RESEARCH
Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windowsJournal of the Operational Research Society Technical Note
Operations Research for the management of a transhipment container terminal: The Gioia Tauro caseMaritime Economics & Logistics Original Article
A generalized crossing local search method for solving vehicle routing problemsJournal of the Operational Research Society Technical Note
Vehicle Routeing with Multiple Use of VehiclesJournal of the Operational Research Society Technical Note
See all 10 matches for Research
