Abstract
The chapter addresses the problem of optimizing the performance of the Ant Colony Optimization (ACO) technique. The area of study is the Travelling Salesmen Problem (TSP) in its static and dynamic version. Although the individual ants making an Ant Colony are remarkably simple their interaction makes the process so complex that an analytical approach to optimize the parameters that control the Ants Colony is not yet possible. Therefore its performance is analyzed optimized on an experimental basis. The experiments strongly suggest that the observed performance is mostly effected by the colony size. In particular the usefulness of the colonies with a very large number of ants, the so called Hyper-Populated Ant Colonies is stressed.
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
Preview
Unable to display preview. Download preview PDF.
References
Dorigo, M.: Optimization, Learning and Natural Algorithms, PhD thesis, Politecnico di Milano, Italie (1992)
Dorigo, M., Stuetzle, T.: Ant Colony Optimization: Overview and Recent Advances, IRIDIA – Technical Report Series, Technical Report No. TR/IRIDIA/2009-013 (May 2009)
Chirico, U.: A Java framework for ant colony systems. In: Ants 2004: Forth International Workshop on Ant Colony Optimization and Swarm Intelligence, Brussels (2004)
Siemiński, A.: TSP/ACO Parameter Optimization; Information Systems Architecture and Technology; System Analysis Approach to the Design, Control and Decision Support, pp. 151–161. Oficyna Wydawnicza Politechniki Wrocławskiej (2011)
Gaertner, D., Clark, K.L.: On optimal parameters for ant colony optimization algorithms. In: IC-AI, pp. 83–89 (2005)
Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer (2003)
Busetti, F.: Simulated Annealing Overview, Report (2003)
Psarafits, H.N.: Dynamic vehicle routing: status and prospects. National Technical Annals of Operations Research. University of Athens, Greece (1995)
Guntsch, M., Middendorf, M.: Pheromone modification strategies for ant algorithms applied to dynamic TSP. In: Boers, E.J.W. (ed.) EvoWorkshops 2001. LNCS, vol. 2037, pp. 213–222. Springer, Heidelberg (2001)
Guntsch, M., Middendorf, M.: A population based approach for ACO. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoWorkshops 2002. LNCS, vol. 2279, pp. 72–81. Springer, Heidelberg (2002)
Mavrovouniotis, M., Yang, S.: Ant colony optimization with immigrants schemes in dynamic environments. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6239, pp. 371–380. Springer, Heidelberg (2010)
Siemiński, A.: Ant colony optimization parameter evaluation. In: Zgrzywa, A., Choroś, K., Siemiński, A. (eds.) Multimedia and Internet Systems: Theory and Practice. AISC, vol. 183, pp. 143–153. Springer, Heidelberg (2013)
Tom, W.: Hadoop the Definite Guide. O’Reilly (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Siemiński, A. (2015). Using ACS for Dynamic Traveling Salesman Problem. In: Zgrzywa, A., Choroś, K., Siemiński, A. (eds) New Research in Multimedia and Internet Systems. Advances in Intelligent Systems and Computing, vol 314. Springer, Cham. https://doi.org/10.1007/978-3-319-10383-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-10383-9_14
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10382-2
Online ISBN: 978-3-319-10383-9
eBook Packages: EngineeringEngineering (R0)