Cooperative ant colony optimization in traffic route calculations

Abstract

Ant Colony Optimization (ACO) algorithms tend to be isolated processes. When applying ACO principles to traffic route calculations, ants exploring the traffic network on behalf of a vehicle typically only perceive and apply pheromones related to that vehicle. Between ants exploring on behalf of different vehicles little cooperation exists. While such cooperation could improve the performance of the ACO algorithm, it is difficult to achieve because ants working on behalf of different vehicles are solving different problems. This paper presents and evaluates a method of cooperation between ants finding routes on behalf of different vehicles by sharing more general knowledge through pheromones. A simulation of the proposed approach is used to evaluate the cooperative ACO algorithm and to compare it with an uncooperative version based on the quality of the calculated routes and the number of iterations needed to find good results. The evaluation indicates that the quality of the solution does not improve and that the speedup is insignificant when using the collaborative variant. © 2012 Springer-Verlag Berlin Heidelberg.