Abstract
The Physarum Network model exhibits the feature of important pipelines being reserved with the evolution of network during the process of solving a maze problem. Drawing on this feature, an Ant Colony System (ACS), denoted as PNACS, is proposed based on the Physarum Network (PN). When updating pheromone matrix, we should update both pheromone trails released by ants and the pheromones flowing in a network. This hybrid algorithm can overcome the low convergence rate and local optimal solution of ACS when solving the Traveling Salesman Problem (TSP). Some experiments in synthetic and benchmark networks show that the efficiency of PNACS is higher than that of ACS. More important, PNACS has strong robustness that is very useful for solving a higher dimension TSP. © 2013 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Qian, T., Zhang, Z., Gao, C., Wu, Y., & Liu, Y. (2013). An ant colony system based on the physarum network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7928 LNCS, pp. 297–305). https://doi.org/10.1007/978-3-642-38703-6_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
