Advertisement

An Ant Colony System Based on the Physarum Network

  • Tao Qian
  • Zili Zhang
  • Chao Gao
  • Yuheng Wu
  • Yuxin Liu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7928)

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.

Keywords

Physarum Network Ant Colony System TSP 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Nakagaki, T., Yamada, H., Toth, A.: Maze-Solving by an Amoeboid Organism. Nature 407(6803), 470 (2000)CrossRefGoogle Scholar
  2. 2.
    Miyaji, T., Ohnishi, I.: Mathematical Analysis to an Adaptive Network of the Plasmodium System. Hokkaido Mathematical Journal 36(2), 445–465 (2007)MathSciNetGoogle Scholar
  3. 3.
    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)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Tero, A., Takagi, S., Saigusa, T., Ito, K., Bebber, D.P., Fricker, M.D., Yumiki, K., Kobayashi, R., Nakagaki, T.: Rules for Biologically Inspired Adaptive Network Design. Science Signalling 327(5964), 439 (2010)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Watanabe, S., Tero, A., Takamatsu, A., Nakagaki, T.: Traffic Optimization in Railroad Networks Using an Algorithm Mimicking an Amoeba-like Organism, Physarum Plasmodium. Biosystems 105(3), 225–232 (2011)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Zhao, N., Wu, Z., Zhao, Y., Quan, T.: Ant Colony Optimization Algorithm with Mutation Mechanism and Its Applications. Expert Systems with Applications 37(7), 4805–4810 (2010)CrossRefGoogle Scholar
  8. 8.
    Blum, C.: Ant Colony Optimization: Introduction and Recent Trends. Physics of Life Reviews 2(4), 353–373 (2005)CrossRefGoogle Scholar
  9. 9.
    Zhang, Y., Zhang, Z., Wei, D., Deng, Y.: Centrality Measure in Weighted Networks Based on an Amoeboid Algorithm. Journal of Information and Computational Science 9(2), 369–376 (2012)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Tao Qian
    • 1
  • Zili Zhang
    • 1
    • 2
  • Chao Gao
    • 1
  • Yuheng Wu
    • 1
  • Yuxin Liu
    • 1
  1. 1.School of Computer and Information ScienceSouthwest UniversityChongqingChina
  2. 2.School of Information TechnologyDeakin UniversityAustralia

Personalised recommendations