Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets

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

Volumn , Issue , 2011, Pages 119-126

  Doerr, Benjamin ^a   Johannsen, Daniel ^a   Schmidt, Martin ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Drift analysis; Evolutionary algorithm; Runtime analysis

Indexed keywords

DRIFT ANALYSIS; FINITE ALPHABET; LINEAR FUNCTIONS; LINEAR POTENTIAL; OPTIMIZING FUNCTIONS; POSITIVE INTEGERS; PSEUDO-BOOLEAN FUNCTION; RUN-TIME ANALYSIS; RUNTIMES; UPPER BOUND;

BOOLEAN FUNCTIONS;

GENETIC ALGORITHMS;

EID: 79956031033     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1967654.1967665     Document Type: Conference Paper

References (19)

1. A. Auger and B. Doerr, editors. Theory of Randomized Seach Heuristics. World Scientific, 2011.
2. S. Baswana, S. Biswas, B. Doerr, T. Friedrich, P. P. Kurur, and F. Neumann. Computing single source shortest paths using single-objective fitness. In FOGA'09, pages 59-66. ACM, 2009.
3. B. Doerr, E. Happ, and C. Klein. A tight analysis of the (1+1)-EA for the single source shortest path problem. In CEC'07, pages 1890-1895. IEEE, 2007.
4. B. Doerr and D. Johannsen. Edge-based representation beats vertex-based representation in shortest path problems. In GECCO'10, pages 759-766. ACM, 2010.
5. B. Doerr, D. Johannsen, and C. Winzen. Drift analysis and linear functions revisited. In CEC'10, pages 1-8. ACM, 2010.
6. B. Doerr, D. Johannsen, and C. Winzen. Multiplicative drift analysis. In GECCO'10, pages 1449-1456. ACM, 2010.
7. B. Doerr, D. Johannsen, and C. Winzen. Multiplicative drift analysis. In GECCO'10, pages 1449-1456. ACM, 2010.
8. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276(1-2):51-81, 2002.
9. C. Gunia. On the analysis of the approximation capability of simple evolutionary algorithms for scheduling problems. In GECCO'05, pages 571-578. ACM, 2005. (Pubitemid 43226345)
10. B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Advances in Applied Probability, 14(3):502-525, 1982.
11. J. He and X. Yao. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127(1):57-85, 2001. (Pubitemid 32264935)
12. J. He and X. Yao. Erratum to: drift analysis and average time complexity of evolutionary algorithms [Artificial Intelligence 127 (2001) 57-85]. Artificial Intelligence, 140(1-2):245-248, 2002.
13. 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)
14. J. Jagerskupper. A blend of Markov-chain and drift analysis. In PPSN'08, pages 41-51. Springer, 2008.
15. F. Neumann and I. Wegener. Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science, 378(1):32-40, 2007. (Pubitemid 46711139)
16. F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization. Springer, 2010.
17. J. Reichel and M. Skutella. Evolutionary algorithms and matroid optimization problems. In GECCO'07, pages 947-954. ACM, 2007. (Pubitemid 47291646)
18. J. Reichel and M. Skutella. On the size of weights in randomized search heuristics. In FOGA'09, pages 21-28. ACM, 2009.
19. J. Scharnow, K. Tinnefeld, and I. Wegener. The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms, 3(4):349-366, 2004. (Pubitemid 40317583)