Ant colony optimization for real-world vehicle routing problems |
| |
| Authors: | A. E. Rizzoli R. Montemanni E. Lucibello L. M. Gambardella |
| |
| Affiliation: | 1. Istituto Dalle Molle di Studi sull’Intelligenza Artificiale (IDSIA), Galleria 2, 6928, Manno, Switzerland
2. AntOptima, via Fusoni 4, 6900, Lugano, Switzerland
|
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
