Simple max-min ant systems and the optimization of linear pseudo-Boolean functions

FOGA'11 - Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI

Volumn , Issue , 2011, Pages 209-218

  Kötzing, Timo ^a   Neumann, Frank ^b   Sudholt, Dirk ^c   Wagner, Markus ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF ADELAIDE   (Australia)

^c UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Ant colony optimization; MMAS; Pseudo Boolean optimization; Runtime analysis; Theory

Indexed keywords

ANT-COLONY OPTIMIZATION; MMAS; PSEUDO-BOOLEAN OPTIMIZATION; RUNTIME ANALYSIS; THEORY;

ARTIFICIAL INTELLIGENCE; BEHAVIORAL RESEARCH; GENETIC ALGORITHMS; OPTIMIZATION;

BOOLEAN FUNCTIONS;

EID: 79956015422     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1967654.1967673     Document Type: Conference Paper

References (20)

1. T. Chen, P. K. Lehre, K. Tang, and X. Yao. When is an estimation of distribution algorithm better than an evolutionary algorithm? In Proc. of CEC 2009, pages 1470-1477. IEEE Press, 2009.
2. T. Chen, K. Tang, G. Chen, and X. Yao. Analysis of computational time of simple estimation of distribution algorithms. IEEE Transactions on Evolutionary Computation, 14(1):1 -22, 2010.
3. B. Doerr, D. Johannsen, and C. H. Tang. How single ant ACO systems optimize pseudo-Boolean functions. In Proc. of PPSN 2008, pages 378-388. Springer, 2008.
4. B. Doerr, F. Neumann, D. Sudholt, and C. Witt. On the runtime analysis of the 1-ANT ACO algorithm. In Proc. of GECCO 2007, pages 33-40. ACM, 2007. (Pubitemid 47291481)
5. M. Dorigo and T. Stutzle. Ant Colony Optimization. MIT Press, 2004.
6. S. Droste. A rigorous analysis of the compact genetic algorithm for linear functions. Natural Computing, 5(3):257-283, 2006. (Pubitemid 44304901)
7. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81, 2002.
8. L. Gleser. On the distribution of the number of successes in independent trials. Annals of Probability, 3(1):182-188, 1975.
9. 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.
10. J. He and X. Yao. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3(1):21-35, 2004. (Pubitemid 39127657)
11. J. Jagerskupper. A blend of Markov-chain and drift analysis. In Proc. of PPSN 2008, pages 41-51. Springer, 2008.
12. T. Jansen and I. Wegener. Evolutionary algorithms -how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation, 5(6):589-599, 2001. (Pubitemid 34091917)
13. T. Kotzing, F. Neumann, H. Röglin, and C. Witt. Theoretical properties of two ACO approaches for the traveling salesman problem. In Proc. of ANTS 2010, pages 324-335. Springer, 2010.
14. F. Neumann, D. Sudholt, and C. Witt. Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intelligence, 3(1):35-68, 2009.
15. F. Neumann, D. Sudholt, and C. Witt. A few ants are enough: ACO with iteration-best update. In Proc. of GECCO 2010, pages 63-70. ACM, 2010.
16. F. Neumann and C. Witt. Runtime analysis of a simple ant colony optimization algorithm. Algorithmica, 54(2):243-255, 2009.
17. F. Neumann and C. Witt. Ant colony optimization and the minimum spanning tree problem. Theoretical Computer Science, 411(25):2406-2413, 2010.
18. T. Stutzle and H. H. Hoos. MAX-MIN ant system. Journal of Future Generation Computer Systems, 16:889-914, 2000.
19. I. Wegener. Theoretical aspects of evolutionary algorithms. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), pages 64-78. Springer, 2001. (Pubitemid 33300789)
20. I. Wegener. Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In R. Sarker, X. Yao, and M. Mohammadian, editors, Evolutionary Optimization, pages 349-369. Kluwer, 2002.