Most of the literature available on vehicle routing problems is about static problems, where all data are known in advance. The technological advances of the last few years rise a new class of problems about dynamic vehicle routing, where new orders are received as time progresses and must be dynamically incorporated into an evolving schedule. In this work an algorithm for this problem, based on the Ant Colony System paradigm, is proposed. Computational results on some problems derived from widely-available benchmarks confirm the efficiency of the method we propose. A realistic case study, based on the road network of the city of Lugano (Switzerland) will be finally presented.
A new algorithm for a dynamic vehicle routing problem based on ant colony system / Montemanni, Roberto; Gambardella Luca, M; Rizzoli Andrea, E; Donati Alberto, V. - 1:1(2003), pp. 27-30. (Intervento presentato al convegno ODYSSEUS 2003 tenutosi a Palermo nel May 2003).
A new algorithm for a dynamic vehicle routing problem based on ant colony system
Montemanni Roberto;
2003
Abstract
Most of the literature available on vehicle routing problems is about static problems, where all data are known in advance. The technological advances of the last few years rise a new class of problems about dynamic vehicle routing, where new orders are received as time progresses and must be dynamically incorporated into an evolving schedule. In this work an algorithm for this problem, based on the Ant Colony System paradigm, is proposed. Computational results on some problems derived from widely-available benchmarks confirm the efficiency of the method we propose. A realistic case study, based on the road network of the city of Lugano (Switzerland) will be finally presented.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
