Standard Steady State Genetic Algorithms Can Hillclimb Faster than
Mutation-only Evolutionary Algorithms

v1v2 (latest)

Standard Steady State Genetic Algorithms Can Hillclimb Faster than Mutation-only Evolutionary Algorithms

4 August 2017

ArXiv (abs)PDF HTML

Papers citing "Standard Steady State Genetic Algorithms Can Hillclimb Faster than Mutation-only Evolutionary Algorithms"

8 / 8 papers shown

Title
Fast Genetic Algorithms Benjamin Doerr H. P. Le Régis Makhmara Ta Duy Nguyen 40 204 0 09 Mar 2017
Escaping Local Optima using Crossover with Emergent or Reinforced Diversity D. Dang Tobias Friedrich Timo Kotzing Martin S. Krejca Per Kristian Lehre P. S. Oliveto Dirk Sudholt Andrew M. Sutton 22 3 0 10 Aug 2016
The Right Mutation Strength for Multi-Valued Decision Variables Benjamin Doerr Carola Doerr Timo Kotzing 26 21 0 12 Apr 2016
A Tight Runtime Analysis of the $(1+(λ, λ))$ Genetic Algorithm on OneMax Benjamin Doerr Carola Doerr ELM 75 36 0 19 Jun 2015
Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings Benjamin Doerr Carola Doerr 46 76 0 13 Apr 2015
How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms Dirk Sudholt 75 61 0 26 Mar 2014
Playing Mastermind With Constant-Size Memory Benjamin Doerr Carola Doerr LRM 72 44 0 17 Oct 2011
A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms Dirk Sudholt 70 157 0 07 Sep 2011