Abstract
In this paper we consider - Ant System and Ant Colony System. They are generally recognized to be the best performing algorithms of the Ant Colony Optimization family. They are characterized by a quite different way for dealing with the pheromone trail. We propose an experimental analysis for observing whether this difference impacts significantly on the characteristics of the pheromone distributions produced during the runs. The results obtained are analyzed by using some concepts derived by the literature on small-world networks. It comes out that ants actually build small-world pheromone graphs during their runs. This behavior is interpreted here as a sort of decomposition of the instances tackled. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Pellegrini, P., & Ellero, A. (2008). The small world of pheromone trails. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5217 LNCS, pp. 387–394). https://doi.org/10.1007/978-3-540-87527-7_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
