Timo Kötzing
ABSTRACT
Understanding the impact of crossover on performance is a major problem in the theory of genetic algorithms (GAs). We present new insight on working principles of crossover by analyzing the performance of crossover-based GAs on the simple functions OneMax and Jump.
First, we assess the potential speedup by crossover when combined with a fitness-invariant bit shuffling operator that simulates a lineage of independent evolution on a function of unitation. Theoretical and empirical results show drastic speedups for both functions.
Second, we consider a simple GA without shuffling and investigate the interplay of mutation and crossover on Jump. If the crossover probability is small, subsequent mutations create sufficient diversity, even for very small populations. Contrarily, with high crossover probabilities crossover tends to lose diversity more quickly than mutation can create it. This has a drastic impact on the performance on Jump. We complement our theoretical findings by Monte Carlo simulations on the population diversity.
- J. Culberson. Genetic invariance: A new paradigm for genetic algorithm design. Technical report, 1992.Google Scholar
- 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. Google ScholarDigital Library
- B. Doerr, E. Happ, and C. Klein. Crossover can provably be useful in evolutionary computation. In Proc. of GECCO '08, pages 539--546. ACM, 2008. Google ScholarDigital Library
- B. Doerr, D. Johannsen, T. Kötzing, F. Neumann, and M. Theile. More effective crossover operators for the all-pairs shortest path problem. In Proc. of PPSN '10, pages 184--193. Springer, 2010. Google ScholarDigital Library
- B. Doerr and M. Theile. Improved analysis methods for crossover-based algorithms. In Proc. of GECCO '09, pages 247--254. ACM, 2009. Google ScholarDigital Library
- S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51--81, 2002. Google ScholarDigital Library
- S. Droste, T. Jansen, and I. Wegener. Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems, 39(4):525--544, 2006. Google ScholarDigital Library
- S. Fischer and I. Wegener. The one-dimensional Ising model: Mutation versus recombination. Theoretical Computer Science, 344(2--3):208--225, 2005. Google ScholarDigital Library
- T. Friedrich, P. S. Oliveto, D. Sudholt, and C. Witt. Analysis of diversity-preserving mechanisms for global exploration. Evolutionary Computation, 17(4):455--476, 2009. Google ScholarDigital Library
- J. He and X. Yao. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3(1):21--35, 2004. Google ScholarDigital Library
- C. Horoba and D. Sudholt. Running time analysis of ACO systems for shortest path problems. In Proc. of SLS '09, pages 76--91. Springer, 2009. Google ScholarDigital Library
- T. Jansen and I. Wegener. The analysis of evolutionary algorithms - a proof that crossover really can help. Algorithmica, 34(1):47--66, 2002.Google ScholarDigital Library
- T. Jansen and I. Wegener. Real royal road functions--where crossover provably is essential. Discrete Applied Mathematics, 149:111--125, 2005. Google ScholarDigital Library
- P. K. Lehre and C. Witt. Black box search by unbiased variation. In Proc. of GECCO '10, pages 1441--1448, 2010. Google ScholarDigital Library
- A. Moraglio. Convex evolutionary search. In Proc. of FOGA '11, pages 151--162. ACM, 2011. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization -- Algorithms and Their Computational Complexity. Springer, 2010. Google ScholarDigital Library
- P. S. Oliveto, J. He, and X. Yao. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. Int'l Journal of Automation and Computing, 4(3):281--293, 2007.Google ScholarCross Ref
- J. N. Richter, A. Wright, and J. Paxton. Ignoble trails - where crossover is provably harmful. In Proc. of PPSN '08, pages 92--101. Springer, 2008. Google ScholarDigital Library
- T. Storch and I. Wegener. Real royal road functions for constant population size. Theoretical Computer Science, 320:123--134, 2004. Google ScholarDigital Library
- D. Sudholt. Crossover is provably essential for the Ising model on trees. In Proc. of GECCO '05, pages 1161--1167. ACM, 2005. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google Scholar
- A. H. Wright, M. D. Vose, and J. E. Rowe. Implicit parallelism. In Proc. of GECCO '03, pages 1505--1517. Springer, 2003. Google ScholarDigital Library
Index Terms
- How crossover helps in pseudo-boolean optimization
Recommendations
Partition Crossover for Pseudo-Boolean Optimization
FOGA '15: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIIIA partition crossover operator is introduced for use with NK landscapes, MAX-kSAT and for all k-bounded pseudo-Boolean functions. By definition, these problems use a bit representation. Under partition crossover, the evaluation of offspring can be ...
Escaping Local Optima with Diversity Mechanisms and Crossover
GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016Population diversity is essential for the effective use of any crossover operator. We compare seven commonly used diversity mechanisms and prove rigorous run time bounds for the (μ+1) GA using uniform crossover on the fitness function Jumpk. All ...
How crossover speeds up building block assembly in genetic algorithms
We reinvestigate a fundamental question: How effective is crossover in genetic algorithms in combining building blocks of good solutions? Although this has been discussed controversially for decades, we are still lacking a rigorous and intuitive answer. ...
Comments