Ignoble Trails - Where Crossover Is Provably Harmful

Beginning with the early days of the genetic algorithm and the schema theorem it. has often been argued that the crossover 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 oil these functions. Recently several new Royal Roads have been introduced and proved to 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.