Improved analysis methods for crossover-based algorithms

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 247-253

  Doerr, Benjamin ^a   Theile, Madeleine ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Combinatorial optimization; Crossover; Evolutionary algorithm

Indexed keywords

ANALYSIS METHOD; CROSSOVER; CROSSOVER OPERATIONS; RUN-TIME RESULTS; SHORTEST PATH PROBLEM;

COMBINATORIAL OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 72749106587     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1569937     Document Type: Conference Paper

References (6)

1. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley, New York, 1992.
2. B. Doerr, E. Happ, and C. Klein. A tight bound for the (1+1)-EA on the single source shortest path problem. In IEEE Congress on Evolutionary Computation 2007, pages 1890-1895, Singapore, 2007. IEEE.
3. B. Doerr, E. Happ, and C. Klein. Crossover can provably be useful in evolutionary computation. In C. Ryan and M. Keijzer, editors, Genetic and Evolutionary Computation Conference 2008, pages 539-546, Atlanta, USA, 2008. ACM.
4. W. Feller. An introduction to probability theory and its applications. Vol. I. Third edition. John Wiley & Sons Inc., New York, 1968.
5. J. Scharnow, K. Tinnefeld, and I. Wegener. Fitness landscapes based on sorting and shortest paths problems. In PPSN, volume 2439 of Lecture Notes in Computer Science, pages 54-63. Springer, 2002.
6. J. Scharnow, K. Tinnefeld, and I. Wegener. The analysis of evolutionary algorithms on sorting and shortest paths problems. Journal of Mathematical Modelling and Algorithms, pages 349-66, 2004.