On the analysis of the simple genetic algorithm

@inproceedings{Oliveto2012OnTA,
  title={On the analysis of the simple genetic algorithm},
  author={Pietro Simone Oliveto and Carsten Witt},
  booktitle={GECCO},
  year={2012}
}
For many years it has been a challenge to analyze the time complexity of Genetic Algorithms (GAs) using stochastic selection together with crossover and mutation. This paper presents a rigorous runtime analysis of the well-known Simple Genetic Algorithm (SGA) for OneMax. It is proved that the SGA has exponential runtime with overwhelming probability for population sizes up to μ≤ n1/8-ε for some arbitrarily small constant ε and problem size n. To the best of our knowledge, this is the first time… CONTINUE READING