Abstract
It is often believed that the performance of ant system, and in general of ant colony optimization algorithms, depends somehow on the scale of the problem instance at hand. The issue has been recently raised explicitly [1] and the hyper-cube framework has been proposed to eliminate this supposed dependency.
In this paper, we show that although the internal state of ant system—that is, the pheromone matrix—depends on the scale of the problem instance under analysis, this does not affect the external behavior of the algorithm. In other words, for an appropriate initialization of the pheromone, the sequence of solutions obtained by ant system does not depend on the scale of the instance.
As a second contribution, the paper introduces a straightforward variant of ant system in which also the pheromone matrix is independent of the scale of the problem instance under analysis.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics—Part B 34(2), 1161–1172 (2004)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: An autocatalytic optimizing process. Technical Report 91-016 Revised, Dipartimento di Elettronica, Politecnico di Milano, Milano, Italy (1991)
Dorigo, M.: Ottimizzazione, apprendimento automatico, ed algoritmi basati su metafora naturale. PhD thesis, Politecnico di Milano, Milano, Italy (1992) (in Italian)
Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics—Part B 26(1), 29–41 (1996)
Birattari, M., Pellegrini, P., Dorigo, M.: On the invariance of ant colony optimization. Technical Report TR/IRIDIA/2006-004, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium (2006) (Submitted for journal publication)
Stützle, T., Hoos, H.H.: The \(\cal MAX\)–\(\cal MIN\) Ant System and local search for the traveling salesman problem. In: Bäck, T., Michalewicz, Z., Yao, X. (eds.) Proceedings of the 1997 IEEE International Conference on Evolutionary Computation (ICEC 1997), Piscataway, NJ, USA, pp. 309–314. IEEE Press, Los Alamitos (1997)
Stützle, T., Hoos, H.H.: \(\cal MAX\)–\(\cal MIN\) ant system. Future Generation Computer Systems 16(8), 889–914 (2000)
Dorigo, M., Gambardella, L.M.: Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Birattari, M., Pellegrini, P., Dorigo, M. (2006). On the Invariance of Ant System. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2006. Lecture Notes in Computer Science, vol 4150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839088_19
Download citation
DOI: https://doi.org/10.1007/11839088_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38482-3
Online ISBN: 978-3-540-38483-0
eBook Packages: Computer ScienceComputer Science (R0)