Optimal Parameter Settings for the (1 + λ, λ) Genetic Algorithm

The (1+(λ,λ)) genetic algorithm is one of the few algorithms for which a super-constant speed-up through the use of crossover could be proven. So far, this algorithm has been used with parameters based also on intuitive considerations. In this work, we rigorously regard the whole parameter space and show that the asymptotic time complexity on the OneMax test function class proven by Doerr and Doerr (GECCO 2015) for the intuitive choice is best possible among all settings for population size, mutation probability, and crossover bias. Our proofs also give some advice on how to choose the parameters for other optimization problems.

[1]  Benjamin Doerr,et al.  Lessons from the black-box: fast crossover-based genetic algorithms , 2013, GECCO '13.

[2]  Thomas Jansen,et al.  Analyzing Evolutionary Algorithms , 2015, Natural Computing Series.

[3]  Benjamin Doerr,et al.  From black-box complexity to designing new genetic algorithms , 2015, Theor. Comput. Sci..

[4]  Benjamin Doerr,et al.  Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings , 2015, GECCO.

[5]  Leslie Ann Goldberg,et al.  Adaptive Drift Analysis , 2011, Algorithmica.

[6]  Benjamin Doerr,et al.  A Tight Runtime Analysis of the $(1+(\lambda, \lambda))$ Genetic Algorithm on OneMax , 2015, 1506.05937.

[7]  Dirk Sudholt,et al.  Crossover is provably essential for the Ising model on trees , 2005, GECCO '05.

[8]  Benjamin Doerr,et al.  Analyzing Randomized Search Heuristics: Tools from Probability Theory , 2011, Theory of Randomized Search Heuristics.

[9]  Carsten Witt,et al.  Population Size vs. Mutation Strength for the (1+λ) EA on OneMax , 2015, GECCO.

[10]  Benjamin Doerr,et al.  Optimal Parameter Settings for the $(1+(\lambda, \lambda))$ Genetic Algorithm , 2016 .

[11]  Per Kristian Lehre,et al.  Black-Box Search by Unbiased Variation , 2010, GECCO '10.

[12]  Xin Yao,et al.  Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..

[13]  Benjamin Doerr,et al.  A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax , 2015, GECCO.

[14]  Xin Yao,et al.  Runtime Analysis of Evolutionary Algorithms for Discrete Optimization , 2011, Theory of Randomized Search Heuristics.

[15]  Benjamin Doerr,et al.  Multiplicative Drift Analysis , 2010, GECCO '10.

[16]  Thomas Jansen,et al.  Analyzing Evolutionary Algorithms: The Computer Science Perspective , 2012 .

[17]  Maxim Buzdalov,et al.  Hard Test Generation for Maximum Flow Algorithms with the Fast Crossover-Based Evolutionary Algorithm , 2015, GECCO.

[18]  Carsten Witt,et al.  Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions† , 2013, Combinatorics, Probability and Computing.

[19]  Thomas Jansen,et al.  The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help , 2002, Algorithmica.

[20]  William F. Punch,et al.  Parameter-less population pyramid , 2014, GECCO.

[21]  Ingo Wegener,et al.  The Ising Model on the Ring: Mutation Versus Recombination , 2004, GECCO.

[22]  Benjamin Doerr,et al.  Crossover can provably be useful in evolutionary computation , 2008, GECCO '08.