Ant Colony Algorithms for the Dynamic Vehicle Routing Problem with Time Windows
The Vehicle Routing Problem with Time Windows relates to frequently occuring real world problems in logistics. Much work has been done on solving static routing problems but solving the dynamic variants has not been given an equal amount of attention, while these are even more relevant to most companies in logistics and transportation. In this work an Ant Colony Optimization algorithm for solving the Dynamic Vehicle Routing Problem with Time Windows is proposed. Customers and time windows are inserted during the working day and need to be integrated in partially committed solutions. Results are presented on a benchmark that generalizes Solomon’s classical benchmark with varying degrees of dynamicity and different variants, including pheromone preservation and the min-max ant system.
KeywordsTime Window Vehicle Route Problem Vehicle Route Problem With Time Window Capacitate Vehicle Route Problem Travel Salesperson Problem
Unable to display preview. Download preview PDF.
- 3.Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Varela, F., Bourgine, P. (eds.) Proceedings of the First European Conference on Artificial Life, Paris, France, pp. 134–142. Elsevier (1991)Google Scholar
- 5.Eyckelhof, C.J., Snoek, M.: Ant systems for a dynamic TSP. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) ANTS 2002. LNCS, vol. 2463, pp. 88–99. Springer, Heidelberg (2002)Google Scholar
- 7.Gambardella, L.M., Taillard, É., Agazzi, G.: MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In: New Ideas in Optimization, ch. 5, pp. 63–76. McGraw-Hill (1999)Google Scholar
- 10.Kilby, P., Prosser, P., Shaw, P.: Dynamic VRPs: a study of scenarios. Technical Report APES-06-1998, University of Strathclyde (September 1998)Google Scholar
- 14.Stützle, T., Hoos, H.: Max-min ant system and local search for the traveling salesman problem. In: IEEE International Conference on Evolutionary Computation, pp. 309–314 (April 1997)Google Scholar