Ant colony optimization for real-world vehicle routing problems
- First Online:
- Cite this article as:
- Rizzoli, A.E., Montemanni, R., Lucibello, E. et al. Swarm Intell (2007) 1: 135. doi:10.1007/s11721-007-0005-x
- 1.1k Downloads
Ant colony optimization (ACO) is a metaheuristic for combinatorial optimization problems. In this paper we report on its successful application to the vehicle routing problem (VRP). First, we introduce the VRP and some of its variants, such as the VRP with time windows, the time dependent VRP, the VRP with pickup and delivery, and the dynamic VRP. These variants have been formulated in order to bring the VRP closer to the kind of situations encountered in the real-world.
Then, we introduce the basic principles of ant colony optimization, and we briefly present its application to the solution of the VRP and of its variants.
Last, we discuss the applications of ACO to a number of real-world problems: a VRP with time windows for a major supermarket chain in Switzerland; a VRP with pickup and delivery for a leading distribution company in Italy; a time dependent VRP for freight distribution in the city of Padua, Italy, where the travel times depend on the time of the day; and an on-line VRP in the city of Lugano, Switzerland, where customers’ orders arrive during the delivery process.