Runtime analysis of the 1-ANT ant colony optimizer

Theoretical Computer Science

Volumn 412, Issue 17, 2011, Pages 1629-1644

  Doerr, Benjamin ^a   Neumann, Frank ^b   Sudholt, Dirk ^c   Witt, Carsten ^d  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF ADELAIDE   (Australia)

^c UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^d TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Ant colony optimization; Runtime analysis; Theory

Indexed keywords

ACO ALGORITHMS; ANT COLONIES; ANT-COLONY OPTIMIZATION; OPTIMIZERS; RANDOMIZED SEARCH HEURISTICS; RUNTIME ANALYSIS; RUNTIME BEHAVIORS; RUNTIMES; THEORETICAL RESULT; THEORY; WORKING PRINCIPLES;

EVAPORATION; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; OPTIMIZATION;

ARTIFICIAL INTELLIGENCE;

EID: 79952073506     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.12.030     Document Type: Article

References (26)

1. R. Motwani, and P. Raghavan Randomized Algorithms 1995 Cambridge University Press
2. S. Droste, T. Jansen, and I. Wegener On the analysis of the (1 + 1 ) evolutionary algorithm Theoretical Computer Science 276 2002 51 81
3. O. Giel, and I. Wegener Evolutionary algorithms and the maximum matching problem H. Alt, M. Habib, Annual Symposium on Theoretical Aspects of Computer Science, STACS Lecture Notes in Computer Science vol. 2607 2003 Springer 415 426
4. F. Neumann, and I. Wegener Randomized local search, evolutionary algorithms, and the minimum spanning tree problem Theoretical Computer Science 378 2007 32 40 (Pubitemid 46711139)
5. C. Witt Worst-case and average-case approximations by simple randomized search heuristics V. Diekert, B. Durand, Annual Symposium on Theoretical Aspects of Computer Science, STACS Lecture Notes in Computer Science vol. 3404 2005 Springer 44 56 (Pubitemid 41241235)
6. B. Doerr, N. Hebbinghaus, and F. Neumann Speeding up evolutionary algorithms through asymmetric mutation operators Evolutionary Computation 15 2007 401 410
7. D. Sudholt Crossover is provably essential for the Ising model on trees Genetic and Evolutionary Computation Conference, GECCO 2005 ACM Press 1161 1167 (Pubitemid 43226428)
8. M. Dorigo, and T. Stützle Ant Colony Optimization 2004 MIT Press
9. W.J. Gutjahr A generalized convergence result for the graph-based ant system metaheuristic Probability in the Engineering and Informational Sciences 17 2003 545 569 (Pubitemid 38126171)
10. D. Merkle, and M. Middendorf Modelling the dynamics of Ant Colony Optimization algorithms Evolutionary Computation 10 2002 235 262
11. M. Dorigo, and C. Blum Ant colony optimization theory: a survey Theoretical Computer Science 344 2005 243 278 (Pubitemid 41554100)
12. W.J. Gutjahr First steps to the runtime complexity analysis of ant colony optimization Computers and Operations Research 35 2008 2711 2727 (Pubitemid 351186799)
13. F. Neumann, and C. Witt Runtime analysis of a simple ant colony optimization algorithm Algorithmica 54 2009 243 255
14. F. Neumann, and C. Witt Ant colony optimization and the minimum spanning tree problem Theoretical Computer Science 411 2010 2406 2413
15. T. Ktzing, F. Neumann, H. Rglin, C. Witt, Theoretical properties of two ACO approaches for the traveling salesman problem, in: Proceedings of the Seventh International Conference on Swarm Intelligence, ANTS 2010, 2010.
16. T. Stützle, and H.H. Hoos MAXMIN ant system Journal of Future Generation Computer Systems 16 2000 889 914
17. W.J. Gutjahr, and G. Sebastiani Runtime analysis of ant colony optimization with best-so-far reinforcement Methodology and Computing in Applied Probability 10 2008 409 433
18. N. Attiratanasunthron, and J. Fakcharoenphol A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs Information Processing Letters 105 2008 88 92 (Pubitemid 350192392)
19. B. Doerr, and D. Johannsen Refined runtime analysis of a basic ant colony optimization algorithm Congress on Evolutionary Computation, CEC 2007 IEEE Press 501 507
20. B. Doerr, D. Johannsen, and C.H. Tang How single ant ACO systems optimize pseudo-Boolean functions G. Rudolph, T. Jansen, S.M. Lucas, C. Poloni, N. Beume, Parallel Problem Solving from NaturePPSN X Lecture Notes in Computer Science vol. 5199 2008 Springer 378 388
21. W.J. Gutjahr Mathematical runtime analysis of ACO algorithms: survey on an emerging issue Swarm Intelligence 1 2007 59 79
22. F. Neumann, and C. Witt Ant colony optimization and the minimum spanning tree problem Theoretical Computer Science 411 2010 2406 2413
23. F. Neumann, D. Sudholt, and C. Witt Analysis of different MMAS ACO algorithms on unimodal functions and plateaus Swarm Intelligence 3 2009 35 68
24. B. Doerr, F. Neumann, D. Sudholt, and C. Witt On the runtime analysis of the 1-ANT ACO algorithm Genetic and Evolutionary Computation Conference, GECCO 2007 ACM 33 40 (Pubitemid 47291481)
25. G. Rudolph Convergence Properties of Evolutionary Algorithms 1997 Verlag Dr. Kova
26. T. Jansen, K.A. De Jong, and I. Wegener On the choice of the offspring population size in evolutionary algorithms Evolutionary Computation 13 2005 413 440 (Pubitemid 43955277)