A comparative analysis of selection schemes used in genetic algorithms

DMCA

A comparative analysis of selection schemes used in genetic algorithms (1991)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by David E. Goldberg , Kalyanmoy Deb

Venue:	Foundations of Genetic Algorithms
Citations:	531 - 31 self

BibTeX

@INPROCEEDINGS{Goldberg91acomparative,
    author = {David E. Goldberg and Kalyanmoy Deb},
    title = {A comparative analysis of selection schemes used in genetic algorithms},
    booktitle = {Foundations of Genetic Algorithms},
    year = {1991},
    pages = {69--93},
    publisher = {Morgan Kaufmann}
}

OpenURL

Abstract

This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference or differential equations, which are verified through computer simulations. The analysis provides convenient approximate or exact solutions as well as useful convergence time and growth ratio estimates. The paper recommends practical application of the analyses and suggests a number of paths for more detailed analytical investigation of selection techniques. Keywords: proportionate selection, ranking selection, tournament selection, Genitor, takeover time, time complexity, growth ratio. 1

Keyphrases

selection scheme genetic algorithm comparative analysis tournament selection detailed analytical investigation differential equation takeover time practical application growth ratio modern genetic algorithm useful convergence time proportionate selection exact solution steady state quot computer simulation growth ratio estimate convenient approximate time complexity selection technique proportionate reproduction deterministic difference

DMCA