Ant Colony Optimization
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
The Structure and Dynamics of Networks: (Princeton Studies in Complexity)
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
On the Explorative Behavior of MAX---MIN Ant System
SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
| Hi-index | 0.00 |
In this paper we consider $\cal M\!AX\!$---$\cal MI\!N\!$ 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.