Article ID: | iaor20061253 |
Country: | Netherlands |
Volume: | 10 |
Issue: | 4 |
Start Page Number: | 327 |
End Page Number: | 343 |
Publication Date: | Dec 2005 |
Journal: | Journal of Combinatorial Optimization |
Authors: | Gambardella L.M., Rizzoli A.E., Montemanni R., Donati A.V. |
Keywords: | programming: travelling salesman |
An abundant 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).