Abstract
An ant colony optimization algorithm with Interesting Level(IL) is presented. We couple a group of parameters with the basic ant colony approach This approach narrates the pheromone increasing style with IL, and the parameter named interesting is used to describe some path’s agglomeration of ants to handle the balance between the convergent speed and the global solution searching ability. We throw the paths into different IL and the ants select their paths according to the paths’ IL. At last, the viability of the approach has been tested with some typical travel salesman problems and encouraging results have been obtained.
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 algorithm. Politecnico di Milano, Italy (1992)
Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Verela, F., Bourgine, P. (eds.) Proceedings of the First European Conference on Artificial Life (ECAL 1991). MITPress, Cambridge (1992)
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man and Cybernetics 1(26), 29–41 (1996)
Dorigo, M., Caro, G., Gambar della, L.: Ant algorithms for discrete optimization. Artificial Life 2(5), 137–172 (1999)
Stutzle, T., Hoos, H.: MAX-MZN Ant System and Local Search for the Traveling Salesman Problem. IEEE, 309–314 (1999)
Mei, H.-B., Xie, L.-Q., Zhou, C.-H.: An Ant Colony Algorithm with the 2nd Newton Law. In: 2010 Second IITA Conference on Geoscience and Remote Sensing, vol. (1), pp. 550–554 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this chapter
Cite this chapter
Jin-ping, Y., Chun-hong, Z., Hong-biao, M. (2012). An Ant Colony Algorithm Based on Interesting Level. In: Jin, D., Lin, S. (eds) Advances in Electronic Commerce, Web Application and Communication. Advances in Intelligent and Soft Computing, vol 149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28658-2_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-28658-2_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28657-5
Online ISBN: 978-3-642-28658-2
eBook Packages: EngineeringEngineering (R0)