Ant Colony System for a Dynamic Vehicle Routing Problem
csal
- Montemanni, R. Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Galleria 2, CH-6928, Manno-Lugano, Switzerland
- Gambardella, L. Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Galleria 2, CH-6928, Manno-Lugano, Switzerland
- Rizzoli, A. Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Galleria 2, CH-6928, Manno-Lugano, Switzerland
- Donati, A. Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Galleria 2, CH-6928, Manno-Lugano, Switzerland
-
2005
Published in:
- Journal of Combinatorial Optimization. - Kluwer Academic Publishers. - 2005, vol. 10, no. 4, p. 327-343
English
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)
- Collections
- Language
-
- English
- Classification
- Computer science and technology
- License
-
License undefinedSpringer Science + Business Media, Inc., 2005
- Identifiers
-
- RERO DOC 312554
- SWISSBIB (NATIONALLICENCE)springer-10.1007/s10878-005-4922-6
- DOI 10.1007/s10878-005-4922-6
- Persistent URL
- https://sonar.ch/global/documents/318806
Statistics
Document views: 48
File downloads:
- Fulltext: 0