Abstract
Very little theory is available to explain the reasons underlying ACO’s success. A population–based ACO (P-ACO) variant is used to explain the reasons of elitist ACO’s success in the TSP, given a globally convex structure of the solution space.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Boese, K.D.: Cost Versus Distance in the Traveling Salesman Problem. Technical Report 950018, University of California, Computer Science Department (1995)
Guntsch, M., Middendorf, M.: Applying Population Based ACO to Dynamic Optimization Problems. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 111–122. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gómez, O., Barán, B. (2004). Arguments for ACO’s Success. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24854-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-24854-5_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22344-3
Online ISBN: 978-3-540-24854-5
eBook Packages: Springer Book Archive