Ant Colony System for a Dynamic Vehicle Routing Problem

R. Montemanni (), L. M. Gambardella, A. E. Rizzoli and A. V. Donati
Additional contact information
R. Montemanni: Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA)
L. M. Gambardella: Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA)
A. E. Rizzoli: Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA)
A. V. Donati: Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA)

Journal of Combinatorial Optimization, 2005, vol. 10, issue 4, No 3, 327-343

Abstract: Abstract An aboundant literature on vehicle routing problems is available. However, most of the work deals with static problems, where all data are known in advance, i.e. before the optimization has started. The technological advances of the last few years give rise to a new class of problems, namely the dynamic vehicle routing problems, where new orders are received as time progresses and must be dynamically incorporated into an evolving schedule. In this paper a dynamic vehicle routing problem is examined and a solving strategy, based on the Ant Colony System paradigm, is proposed. Some new public domain benchmark problems are defined, and the algorithm we propose is tested on them. Finally, the method we present is applied to a realistic case study, set up in the city of Lugano (Switzerland).

Keywords: dynamic vehicle routing; ant colony optimization (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (37)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-005-4922-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:10:y:2005:i:4:d:10.1007_s10878-005-4922-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-005-4922-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().