Name
Abstract | ||
|---|---|---|
Beginning with the early days of the genetic algorithm and the schema theorem it has often been argued that the crossover operator is the more important genetic operator. The early Royal Road functions were put forth as an example where crossover would excel, yet mutation based EAs were subsequently shown to experimentally outperform GAs with crossover on these functions. Recently several new Royal Roads have been introduced and proved to require expected polynomial time for GAs with crossover, while needing exponential time to optimize for mutation-only EAs. This paper does the converse, showing proofs that GAs with crossover require exponential optimization time on new Ignoble Trail functions while mutation based EAs optimize them efficiently. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-87700-4_10 | PPSN |
Keywords | Field | DocType |
ignoble trails,new ignoble trail function,exponential optimization time,crossover operator,provably harmful,genetic algorithm,exponential time,polynomial time,early day,early royal road function,mutation-only eas,important genetic operator,genetic operator | Converse,Genetic operator,Mathematical optimization,Crossover,Exponential function,Computer science,Algorithm,Mathematical proof,Operator (computer programming),Time complexity,Genetic algorithm | Conference |
Volume | ISSN | Citations |
5199 | 0302-9743 | 10 |
PageRank | References | Authors |
0.56 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Neal Richter | 1 | 25 | 4.38 |
| Alden Wright | 2 | 24 | 2.69 |
| John Paxton | 3 | 16 | 4.26 |