Skip to main content
SpringerLink
Log in

Ant Colony Optimization

  • Chapter
  • First Online:
Search and Optimization by Metaheuristics

Abstract

Ants are capable of finding the shortest path between the food and the colony using a pheromone-laying mechanism. ACO is a metaheuristic optimization approach inspired by this foraging behavior of ants. This chapter is dedicated to ACO.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 99.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Bilchev G, Parmee IC. The ant colony metaphor for searching continuous design spaces. In: Fogarty TC, editor. Proceedings of AISB workshop on evolutionary computing, Sheffield, UK, April 1995, vol. 993 of Lecture notes in computer science. London: Springer; 1995. p. 25–39.

    Google Scholar 

  2. Dorigo M, Di Caro G, Gambardella LM. Ant algorithms for discrete optimization. Artif Life. 1999;5(2):137–72.

    Article  Google Scholar 

  3. Dorigo M, Gambardella LM. A study of some properties of Ant-Q. In: Proceedings of the 4th international conference on parallel problem solving from nature (PPSN IV), Berlin, Germany, September 1996. p. 656–665.

    Google Scholar 

  4. Dorigo M, Gambardella LM. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput. 1997;1(1):53–66.

    Article  Google Scholar 

  5. Dorigo M, Maniezzo V, Colorni A. Positive feedback as a search strategy. Dipartimento di Elettronica, Politecnico di Milano, Milan, Italy, Technical Report, 1991. p. 91–016:

    Google Scholar 

  6. Dorigo M, Stutzle T. Ant colony optimization. Cambridge: MIT Press; 2004.

    MATH  Google Scholar 

  7. Dreo J, Siarry P. Continuous interacting ant colony algorithm based on dense heterarchy. Future Gener Comput Syst. 2004;20(5):841–56.

    Article  Google Scholar 

  8. Gambardella LM, Dorigo M. Ant-Q: a reinforcement learning approach to the traveling salesman problem. In: Proceedings of the 12th international conference on machine learning, Tahoe City, CA, USA, July 1995. p. 252–260.

    Google Scholar 

  9. Hu X-M, Zhang J, Chung HS-H, Li Y, Liu O. SamACO: variable sampling ant colony optimization algorithm for continuous optimization. IEEE Trans Syst Man Cybern Part B. 2010;40:1555–66.

    Article  Google Scholar 

  10. Hu X-M, Zhang J, Li Y. Orthogonal methods based ant colony search for solving continuous optimization problems. J Comput Sci Technol. 2008;23(1):2–18.

    Article  Google Scholar 

  11. Huang H, Wu C-G, Hao Z-F. A pheromone-rate-based analysis on the convergence time of ACO algorithm. IEEE Trans Syst Man Cybern Part B. 2009;39(4):910–23.

    Article  Google Scholar 

  12. Liao T, Socha K, Montes de Oca MA, Stutzle T, Dorigo M. Ant colony optimization for mixed-variable optimization problems. IEEE Trans Evol Comput. 2013;18(4):503–18.

    Article  Google Scholar 

  13. Liu L, Dai Y, Gao J. Ant colony optimization algorithm for continuous domains based on position distribution model of ant colony foraging. Sci World J. 2014; 2014:9 p. Article ID 428539.

    Google Scholar 

  14. Merkle D, Middendorf M. Modeling the dynamics of ant colony optimization. Evol Comput. 2002;10(3):235–62.

    Article  MATH  Google Scholar 

  15. Monmarche N, Venturini G, Slimane M. On how Pachycondyla apicalis ants suggest a new search algorithm. Future Gener Comput Syst. 2000;16(9):937–46.

    Article  Google Scholar 

  16. Neumann F, Witt C. Runtime analysis of a simple ant colony optimization algorithm. In: Proceedings of the 17th international symposium on algorithms and computation, Kolkata, India, December 2006. vol. 4288 of Lecture notes in computer science. Berlin: Springer; 2006. p. 618–627.

    Google Scholar 

  17. Pourtakdoust SH, Nobahari H. An extension of ant colony system to continuous optimization problems. In: Proceedings of the 4th international workshop on ant colony optimization and swarm intelligence (ANTS 2004), Brussels, Belgium, September 2004. p. 294–301.

    Google Scholar 

  18. Socha K. ACO for continuos and mixed-variable optimization. In: Proceedings of the 4th international workshop on ant colony optimization and swarm intelligence (ANTS 2004), Brussels, Belgium, September 2004. p. 25–36.

    Google Scholar 

  19. Socha K, Dorigo M. Ant colony optimization for continuous domains. Eur J Oper Res. 2008;185(3):1115–73.

    Article  MathSciNet  MATH  Google Scholar 

  20. Stutzle T, Hoos HH. The MAX-MIN ant system and local search for the traveling salesman problem. In: Proceedings of IEEE international conference on evolutionary computation (CEC), Indianapolis, IN, USA, April 1997. p. 309–314.

    Google Scholar 

  21. Stutzle T, Dorigo M. A short convergence proof for a class of ant colony optimization algorithms. IEEE Trans Evol Comput. 2002;6(4):358–65.

    Article  Google Scholar 

  22. Turner JS. Termites as models of swarm cognition. Swarm Intell. 2011;5:19–43.

    Article  Google Scholar 

  23. Wodrich M, Bilchev G. Cooperative distributed search: the ants’ way. Control Cybern. 1997;26(3):413–46.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Xonlink Inc, Ningbo, Zhejiang, China

    Ke-Lin Du

  2. Department of Electrical and Computer Engineering, Concordia University, Montreal, QC, Canada

    Ke-Lin Du & M. N. S. Swamy

Authors
  1. Ke-Lin Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. N. S. Swamy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ke-Lin Du .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Du, KL., Swamy, M.N.S. (2016). Ant Colony Optimization. In: Search and Optimization by Metaheuristics. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-41192-7_11

Download citation

Publish with us

Policies and ethics

Search

Navigation