A few ants are enough: ACO with iteration-best update

Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Volumn , Issue , 2010, Pages 63-70

  Neumann, Frank ^a   Sudholt, Dirk ^b   Witt, Carsten ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Ant colony optimization; Iteration Best update; Runtime analysis; Theory

Indexed keywords

ANT-COLONY OPTIMIZATION; COLLECTIVE MEMORIES; EVAPORATION RATE; ITERATION-BEST UPDATE; LOWER BOUNDS; PROBLEM DOMAIN; RUN-TIME ANALYSIS; SHARP CONTRAST; THEORY;

EVAPORATION; EVOLUTIONARY ALGORITHMS; OPTIMIZATION;

ARTIFICIAL INTELLIGENCE;

EID: 77955865459     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830483.1830493     Document Type: Conference Paper

References (19)

1. 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(3) :88-92, 2008.
2. B. Doerr, F. Neumann, D. Sudholt, andC. Witt. On the runtime analysis of the 1-ANT ACO algorithm. In H. Lipson, editor, GECCO, pages 33-40, ACM, 2007.
3. M. Dorigo andT. Stützle. Ant Colony Optimization. MIT Press, 2004.
4. S. Droste, A rigorous analysis of the compact genetic algorithm for linear functions, Natural Computing, 5(3):257-283, 2006.
5. S. Droste, T. Jansen, and I. Wegener, On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81, 2002.
6. W. J. Gutjahr and G. Sebastiani, Runtime analysis of ant colony optimization with best-so-far reinforcement, Methodology and Computing in Applied Probability, 10:409-433, 2008.
7. J. He and X. Yao, A study of drift analysis for estimating computation time of evolutionary algorithms, Natural Computing, 3(1):21-35, 2004.
8. C. Horoba and D. Sudholt, Running time analysis of ACO systems for shortest path problems, In Proc. of SLS '09, volume 5752 of LNCS, pages 76-91. Springer, 2009.
9. J. Jägersküpper and T. Storch, When the plus strategy outperforms the comma strategy and when not. In FOCI, pages 25-32. IEEE, 2007.
10. T. Jansen, K. A. De Jong, and I. Wegener, On the choice of the offspring population size in evolutionary algorithms, Evolutionary Computation, 13(4):413-440, 2005.
11. H. Mühlenbein. How genetic algorithms really work: mutation and hillclimbing. In Proc. of PPSN '92, pages 15-26, Elsevier, 1992.
12. F. Neumann, P. S. Oliveto, andC. Witt. Theoretical analysis of fitness-proportional selection: landscapes and efficiency, In F. Rothlauf, editor, GECCO, pages 835-842. ACM, 2009.
13. F. Neumann, D. Sudholt, andC. Witt. Analysis of different MMAS ACO algorithms on unimodal functions and plateaus, Swarm Intelligence, 3:35-68, 2009.
14. F. Neumann andC. Witt. Runtime analysis of a simple ant colony optimization algorithm, Algorithmica, 54(2):243-255, 2009.
15. P. S. Oliveto and C. Witt, Simplified drift analysis for proving lower bounds in evolutionary computation, Algorithmica, 2010, In press, http://dx.doi.org/10.1007/s00453-010-9387-z.
16. T. Stützle andH. H. Hoos, MAX-MIN ant system. Journal of Future Generation Computer Systems, 16:889-914, 2000.
17. D. Sudholt, Computational Complexity of Evolutionary Algorithms, Hybridizations, and Swarm Intelligence. PhD thesis, Technische Universität Dortmund, 2008.
18. D. Sudholt and C. Witt, Runtime analysis of a binary particle swarm optimizer, Theoretical Computer Science, 2010, In press, http://dx.doi.org/10. 1016/j.tcs.2010.03.002.
19. Y. Zhou. Runtime analysis of an ant colony optimization algorithm for TSP instances, IEEE Transactions on Evolutionary Computation, 13(5):1083-1092, 2009.