Skip to main content

2016 | OriginalPaper | Buchkapitel

11. Ant Colony Optimization

verfasst von : Ke-Lin Du, M. N. S. Swamy

Erschienen in: Search and Optimization by Metaheuristics

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat 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. 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.
2.
Zurück zum Zitat Dorigo M, Di Caro G, Gambardella LM. Ant algorithms for discrete optimization. Artif Life. 1999;5(2):137–72.CrossRef Dorigo M, Di Caro G, Gambardella LM. Ant algorithms for discrete optimization. Artif Life. 1999;5(2):137–72.CrossRef
3.
Zurück zum Zitat 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. 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.
4.
Zurück zum Zitat 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.CrossRef 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.CrossRef
5.
Zurück zum Zitat 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: 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:
6.
Zurück zum Zitat Dorigo M, Stutzle T. Ant colony optimization. Cambridge: MIT Press; 2004.MATH Dorigo M, Stutzle T. Ant colony optimization. Cambridge: MIT Press; 2004.MATH
7.
Zurück zum Zitat Dreo J, Siarry P. Continuous interacting ant colony algorithm based on dense heterarchy. Future Gener Comput Syst. 2004;20(5):841–56.CrossRef Dreo J, Siarry P. Continuous interacting ant colony algorithm based on dense heterarchy. Future Gener Comput Syst. 2004;20(5):841–56.CrossRef
8.
Zurück zum Zitat 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. 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.
9.
Zurück zum Zitat 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.CrossRef 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.CrossRef
10.
Zurück zum Zitat 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.CrossRef 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.CrossRef
11.
Zurück zum Zitat 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.CrossRef 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.CrossRef
12.
Zurück zum Zitat 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.CrossRef 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.CrossRef
13.
Zurück zum Zitat 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. 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.
14.
Zurück zum Zitat Merkle D, Middendorf M. Modeling the dynamics of ant colony optimization. Evol Comput. 2002;10(3):235–62.CrossRefMATH Merkle D, Middendorf M. Modeling the dynamics of ant colony optimization. Evol Comput. 2002;10(3):235–62.CrossRefMATH
15.
Zurück zum Zitat 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.CrossRef 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.CrossRef
16.
Zurück zum Zitat 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. 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.
17.
Zurück zum Zitat 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. 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.
18.
Zurück zum Zitat 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. 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.
20.
Zurück zum Zitat 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. 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.
21.
Zurück zum Zitat 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.CrossRef 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.CrossRef
22.
Zurück zum Zitat Turner JS. Termites as models of swarm cognition. Swarm Intell. 2011;5:19–43.CrossRef Turner JS. Termites as models of swarm cognition. Swarm Intell. 2011;5:19–43.CrossRef
23.
Zurück zum Zitat Wodrich M, Bilchev G. Cooperative distributed search: the ants’ way. Control Cybern. 1997;26(3):413–46.MathSciNetMATH Wodrich M, Bilchev G. Cooperative distributed search: the ants’ way. Control Cybern. 1997;26(3):413–46.MathSciNetMATH
Metadaten
Titel
Ant Colony Optimization
verfasst von
Ke-Lin Du
M. N. S. Swamy
Copyright-Jahr
2016
DOI
https://doi.org/10.1007/978-3-319-41192-7_11

Premium Partner