Citation
Tabu Search Techniques for the Heterogeneous Vehicle Routing Problem with Time Windows and Carrier-Dependent Costs. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 594-605, 2009.
Paper
Abstract
In this work we formalize a new complex variant of the classical vehicle routing problem arising from a real-world application. Our formulation includes a heterogeneous fleet, a multi-day planning horizon, a complex carrier-dependent cost function for the vehicles, and the possibility of leaving orders unscheduled. We propose a metaheuristic approach based on tabu search and on a complex combination of neighborhood relations. Finally, we perform an experimental analysis to tune and compare di erent combinations, highlighting the most important features of the algorithm.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2009-594-605-P, author = {S. Ceschia and A. Schaerf},
title = {Tabu Search Techniques for the Heterogeneous Vehicle Routing Problem with Time Windows and Carrier-Dependent Costs},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {594--605},
note = {Paper},
abstract = {In this work we formalize a new complex variant of the classical vehicle routing problem arising from a real-world application. Our formulation includes a heterogeneous fleet, a multi-day planning horizon, a complex carrier-dependent cost function for the vehicles, and the possibility of leaving orders unscheduled. We propose a metaheuristic approach based on tabu search and on a complex combination of neighborhood relations. Finally, we perform an experimental analysis to tune and compare di erent combinations, highlighting the most important features of the algorithm.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-594-605-P.pdf} }