Crossover speeds up building-block assembly

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

Volumn , Issue , 2012, Pages 689-696

  Sudholt, Dirk ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

building block hypothesis; crossover; mutation rate; recombination; runtime analysis; theory

Indexed keywords

BUILDING-BLOCK HYPOTHESIS; CROSSOVER; MUTATION RATES; RECOMBINATION; RUN-TIME ANALYSIS; THEORY;

STATISTICAL TESTS;

EID: 84864697770     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2330163.2330260     Document Type: Conference Paper

References (26)

1. M. Abramowitz and I. A. Stegun. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Dover, New York, ninth Dover printing, tenth GPO printing edition, 1964.
2. M. Dietzfelbinger, B. Naudts, C. Van Hoyweghen, and I. Wegener. The analysis of a recombinative hill-climber on H-IFF. IEEE Transactions on Evolutionary Computation, 7(5):417-423, 2003.
3. B. Doerr, E. Happ, and C. Klein. Crossover can provably be useful in evolutionary computation. Theoretical Computer Science, 425(0):17-33, 2012.
4. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81, 2002.
5. S. Fischer and I. Wegener. The one-dimensional Ising model: Mutation versus recombination. Theoretical Computer Science, 344(2-3):208-225, 2005.
6. S. Forrest and M. Mitchell. Relative building block fitness and the building block hypotheses. In Proc. of FOGA 2, pages 198-226. Morgan Kaufmann, 1993.
7. T. Jansen, K. A. De Jong, and I. Wegener. On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation, 13:413-440, 2005.
8. T. Jansen and I. Wegener. On the choice of the mutation probability for the (1+1) EA. In PPSN '00, volume 1917, pages 89-98. Springer, 2000.
9. T. Jansen and I. Wegener. On the analysis of evolutionary algorithms-a proof that crossover really can help. Algorithmica, 34(1):47-66, 2002.
10. T. Jansen and I. Wegener. Real royal road functions-where crossover provably is essential. Discrete Applied Mathematics, 149:111-125, 2005.
11. T. Jansen and C. Zarges. Analysis of evolutionary algorithms: from computational complexity analysis to algorithm engineering. In Proc. of FOGA '11, pages 1-14. ACM, 2011.
12. T. Kötzing, D. Sudholt, and M. Theile. How crossover helps in pseudo-Boolean optimization. In Proc. of GECCO '11, pages 989-996. ACM Press, 2011.
13. J. Lässig and D. Sudholt. General scheme for analyzing running times of parallel evolutionary algorithms. In PPSN '10, pages 234-243. Springer, 2010.
14. M. Mitchell, S. Forrest, and J. H. Holland. The royal road function for genetic algorithms: fitness landscapes and GA performance. In Proc. of the 1st European Conference on Artificial Life, pages 245-254. MIT Press, 1992.
15. M. Mitchell, J. H. Holland, and S. Forrest. When will a genetic algorithm outperform hill climbing? In Advances in Neural Information Processing Systems, pages 51-58. Morgan Kaufmann, 1994.
16. F. Neumann, P. S. Oliveto, and C. Witt. Theoretical analysis of fitness-proportional selection: landscapes and efficiency. In Proc. of GECCO '09, pages 835-842. ACM Press, 2009.
17. F. Neumann and M. Theile. How crossover speeds up evolutionary algorithms for the multi-criteria all-pairs-shortest-path problem. In Proc. of PPSN '10, pages 667-676. Springer, 2010.
18. T. Storch and I. Wegener. Real royal road functions for constant population size. Theoretical Computer Science, 320:123-134, 2004.
19. D. Sudholt. Crossover is provably essential for the Ising model on trees. In Proc. of GECCO '05, pages 1161-1167. ACM Press, 2005.
20. D. Sudholt. General lower bounds for the running time of evolutionary algorithms. In PPSN '10, pages 124-133. Springer, 2010.
21. D. Sudholt. A new method for lower bounds on the running time of evolutionary algorithms. ArXiv e-prints, 2011. Available from http://arxiv.org/abs/1109.1504.
22. D. Sudholt and C. Thyssen. Running time analysis of ant colony optimization for shortest path problems. Journal of Discrete Algorithms, 2012. To appear.
23. R. A. Watson and T. Jansen. A building-block royal road where crossover is provably essential. In Proc. of GECCO '07, pages 1452-1459. ACM, 2007.
24. I. Wegener and C. Witt. On the optimization of monotone polynomials by simple randomized search heuristics. Combinatorics, Probability and Computing, 14:225-247, 2005.
25. C. Witt. Runtime analysis of the (μ+1) EA on simple pseudo-Boolean functions. Evolutionary Computation, 14(1):65-86, 2006.
26. C. Witt. Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation. In Proc. of STACS '12, pages 420-431, 2012.