Abstract
The solutions to Traveling Salesman Problem can be widely applied in many real-world problems. Ant colony optimization algorithms can provide an approximate solution to a Traveling Salesman Problem. However, most ant colony optimization algorithms suffer premature convergence and low convergence rate. With these observations in mind, a novel ant colony system is proposed, which employs the unique feature of critical tubes reserved in the Physaurm-inspired mathematical model. A series of experiments are conducted, which are consolidated by two real-world Traveling Salesman Problems. The experimental results show that the proposed new ant colony system outperforms classical ant colony system, genetic algorithm, and particle swarm optimization algorithm in efficiency and robustness.
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
Colorni, A., Dorigo, M., Maniezzo, V.: Distributed Optimization by Ant Colonies. In: Proceedings of the First European Conference on Artificial Life, vol. 142, pp. 134–142 (1991)
Wang, K.P., Huang, L., Zhou, C.G., Pang, W.: Particle Swarm Optimization for Traveling Salesman Problem. In: Proceedings of the Second International Conference on Machine Learning and Cybernetics, Xi’an, China, vol. 3, pp. 1583–1585 (2003)
Chatterjee, S., Carrera, C., Lynch, L.A.: Genetic Algorithms and Traveling Salesman Problems. European Journal of Operational Research 93(3), 490–510 (1996)
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)
Hlaing, Z.C.S.S., Khine, M.A.: Solving Traveling Salesman Problem by Using Improved Ant Colony Optimization Algorithm. International Journal of Information and Education Technology 1(5), 404–409 (2011)
Nakagaki, T., Yamada, H., Tóth, A.: Maze-Solving by an Amoeboid Organism. Nature 407(6803), 470 (2000)
Adamatzky, A., Martinez, G.J.: Bio-Imitation of Mexican Migration Routes to the USA with Slime Mould on 3D Terrains. Journal of Bionic Engineering 10(2), 242–250 (2013)
Tero, A., Kobayashi, R., Nakagaki, T.: A Mathematical Model for Adaptive Transport Network in Path Finding by True Slime Mold. Journal of Theoretical Biology 244(4), 553–564 (2007)
Qian, T., Zhang, Z., Gao, C., Wu, Y., Liu, Y.: An Ant Colony System Based on the Physarum Network. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI 2013, Part I. LNCS, vol. 7928, pp. 297–305. Springer, Heidelberg (2013)
Zhang, Z.L., Gao, C., Liu, Y.X., Qian, T.: A Universal Optimization Strategy for Ant Colony Optimization Algorithms Based on the Physarum-Inspired Mathematical Model. Bioinspiration and Biomimetics 9, 036006 (2014)
Wikipedia, http://en.wikipedia.org/wiki/Great-circle_distance#cite_note-3
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Lu, Y., Liu, Y., Gao, C., Tao, L., Zhang, Z. (2014). A Novel Physarum-Based Ant Colony System for Solving the Real-World Traveling Salesman Problem. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds) Advances in Swarm Intelligence. ICSI 2014. Lecture Notes in Computer Science, vol 8794. Springer, Cham. https://doi.org/10.1007/978-3-319-11857-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-11857-4_20
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11856-7
Online ISBN: 978-3-319-11857-4
eBook Packages: Computer ScienceComputer Science (R0)