Name
Abstract | ||
|---|---|---|
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 @m= |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.tcs.2013.06.015 | Theoretical Computer Science |
Keywords | DocType | Volume |
crossover,runtime analysis,simple genetic algorithm | Journal | 545 |
Issue | ISSN | Citations |
1 | 0304-3975 | 24 |
PageRank | References | Authors |
0.92 | 24 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pietro S. Oliveto | 1 | 381 | 17.67 |
| Carsten Witt | 2 | 987 | 59.83 |