Abstract
Ant Colony System (ACS) is a well known metaheuristic algorithm for solving difficult optimization problems inspired by the foraging behaviour of social insects (ants). Artificial ants in the ACS cooperate indirectly through deposition of pheromone trails on the edges of the problem representation graph. All trails are stored in a pheromone memory, which in the case of the Travelling Salesman Problem (TSP) requires O(n 2) memory storage, where n is the size of the problem instance. In this work we propose a novel selective pheromone memory model for the ACS in which pheromone values are stored only for the selected subset of trails. Results of the experiments conducted on several TSP instances show that it is possible to significantly reduce ACS memory requirements (by a constant factor) without impairing the quality of the solutions obtained.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blum, C.: Ant colony optimization: Introduction and recent trends. Physics of Life Reviews 2(4), 353–373 (2005)
Czech, Z.J.: Statistical measures of a fitness landscape for the vehicle routing problem. In: IPDPS, pp. 1–8. IEEE (2008)
Dorigo, M., Blumb, C.: Ant colony optimization theory: A survey. Theoretical Computer Science 344, 243–278 (2005)
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)
Dorigo, M., Stützle, T.: Ant Colony Optimization. Bradford Books, MIT Press (2004)
Matthews, D.C.: Improved Lower Limits for Pheromone Trails in Ant Colony Optimization. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN X. LNCS, vol. 5199, pp. 508–517. Springer, Heidelberg (2008)
Megiddo, N.: Outperforming lru with an adaptive replacement cache algorithm. IEEE Computer 37(4), 58–65 (2004)
Reinelt, G.: Tsplib95, http://www.iwr.uni-heidelberg.de/groups/comopt/-software/tsplib95/index.html
Stützle, T., Hoos, H.H.: Max–min ant system. Future Generation Computer Systems 16, 889–914 (2000)
Zlochin, M., Birattari, M., Meuleau, N., Dorigo, M.: Model-based search for combinatorial optimization: A critical survey. Annals of Operations Research 131(1), 373–395 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Skinderowicz, R. (2012). Ant Colony System with Selective Pheromone Memory for TSP. In: Nguyen, NT., Hoang, K., Jȩdrzejowicz, P. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2012. Lecture Notes in Computer Science(), vol 7654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34707-8_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-34707-8_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34706-1
Online ISBN: 978-3-642-34707-8
eBook Packages: Computer ScienceComputer Science (R0)