Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet

GECCO'12 - Proceedings of the 14th International Conference on Genetic and Evolutionary Computation

Volumn , Issue , 2012, Pages 1317-1324

  Doerr, Benjamin ^a   Pohl, Sebastian ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

drift analysis; linear function; run time analysis; theory

Indexed keywords

CONSTANT FACTORS; DRIFT ANALYSIS; EXPECTED TIME; FINITE ALPHABET; LINEAR FUNCTIONS; LOWER BOUNDS; MUTATION PROBABILITY; OPTIMAL ANALYSIS; RUN-TIME ANALYSIS; RUNTIMES; THEORY; UPPER BOUND;

OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 84864655053     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2330163.2330346     Document Type: Conference Paper

References (15)

1. A. Auger and B. Doerr, editors. Theory of Randomized Search Heuristics, volume 1 of Series on Theoretical Computer Science. 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: Proceedings of the 10th ACM Workshop on Foundations of Genetic Algorithms, pages 59-66. ACM, 2009.
3. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statistics, 23(4):493-507, 1952.
4. B. Doerr and L. A. Goldberg. Adaptive drift analysis. In PPSN '10: Proceedings of the 11th International Conference on Parallel Problem Solving from Nature, pages 32-41, 2010.
5. B. Doerr, D. Johannsen, and M. Schmidt. Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets. In Proceedings of the 11th Workshop Proceedings on Foundations of Genetic Algorithms, FOGA '11, pages 119-126. ACM, 2011.
6. B. Doerr, D. Johannsen, and C. Winzen. Drift analysis and linear functions revisited. In CEC'10: Proceedings of the 2010 IEEE Congress on Evolutionary Computation, pages 1967-1974. IEEE, 2010.
7. B. Doerr, D. Johannsen, and C. Winzen. Multiplicative drift analysis. In GECCO'10: Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, 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: Proceedings of the 7th Annual Genetic and Evolutionary Computation Conference, pages 571-578. Jahn, 2005.
10. J. He and X. Yao. Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence, 127(1):51-81, 2001.
11. J. He and X. Yao. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3(1):21-35, 2004.
12. J. Jägersküpper. A blend of Markov-chain and drift analysis. In PPSN '08: Proceedings of the 10th International Conference on Parallel Problem Solving from Nature, pages 41-51. Springer, 2008.
13. D. Johannsen. Random Combinatorial Structures and Randomized Search Heuristics. PhD thesis, Universität des Saarlandes, 2010. Available online at http://scidok.sulb.uni-saarland.de/volltexte/2011/ 3529/pdf/Dissertation 3166 Joha Dani 2010.pdf.
14. J. Scharnow, K. Tinnefeld, and I. Wegener. The analysis of evolutionary algorithms on sorting and shortest path problems. Journal of Mathematical Modelling and Algorithms, 3(4):349-366, 2004.
15. C. Witt. Optimizing linear functions with randomized search heuristics - the robustness of mutation. In STACS '12: Proceedings of the 29th Annual Symposium on Theoretical Aspects of Computer Science, pages 420-431, 2012.