Skip to main content

A Novel Ant Colony Optimization Algorithm in Application of Pheromone Diffusion

  • Conference paper
Life System Modeling and Intelligent Computing (ICSEE 2010, LSMS 2010)

Abstract

Ant Colony Optimization (ACO) Algorithm is a novel stochastic search technology, which simulates the social behavior of ant colony. This paper firstly analyzes the shortcomings of basic ACO, then presents an enhanced ACO algorithm which is more faithful to real ants’ behavior in application of pheromone diffusion. By setting up the pheromone diffusion model, the algorithm improves the collaboration among the nearby ants. The simulation results show that the proposed algorithm can not only get much more optimal solutions but also greatly enhance convergence speed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B 26(1), 29–41 (1996)

    Article  Google Scholar 

  2. 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)

    Article  Google Scholar 

  3. Holden, N., Freitas, A.A.: Web Page Classification with an Ant Colony Algorithm. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guervós, J.J., Bullinaria, J.A., Rowe, J.E., Tiňo, P., Kabán, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 1092–1102. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Stutzle, T., Dorigo, M.: A short convergence proof for a class of ACO algorithms. IEEE Transactions on Evolutionary Computation, 358–365 (2002)

    Google Scholar 

  5. Blum, C., Dorigo, M.: Search bias in ant colony optimization: On the role of competition-balanced systems. IEEE Trans. on Evolutionary Computation, 159–174 (2005)

    Google Scholar 

  6. Dorigo, M., Thomas, S.: Ant Colony Optimization, pp. 223–244. Prentice-Hall of India Publication, New Delhi (2005)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhu, P., Zhao, Ms., He, Tc. (2010). A Novel Ant Colony Optimization Algorithm in Application of Pheromone Diffusion. In: Li, K., Fei, M., Jia, L., Irwin, G.W. (eds) Life System Modeling and Intelligent Computing. ICSEE LSMS 2010 2010. Lecture Notes in Computer Science, vol 6329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15597-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15597-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15596-3

  • Online ISBN: 978-3-642-15597-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics