Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · 2001 · 141 citations · 7 references
Mutation and crossov r are th main s arch op rators of different variants of evolutionary algorithms. Despite the many discussions on the importance of crossover nobody has proved rigorously for some explicitly defined fitness functions fn : {0 , 1 }n -> R that a genetic algorithm with crossover (but without idealization)can optimize fn in expected polynomial time while all volution strategies based only on mutation (and selection) need expected exponential time. Here such functions and proofs are presented. For some functions one-point crossover is appropriate while for others uniform crossover is the right choice.
7
Genetic algorithms in search, optimization, and machine learning
Choice Reviews Online · 1989 · 49.3K citations
An Introduction to the Theory of Statistics
An introduction to genetic algorithms
Fred Nijhout · Complexity · 1997 · 1.3K citations
The 2003 Congress on Evolutionary Computation - CEC 2003
2003 · 83 citations