A Comparative Analysis of Selection Schemes Used in Genetic Algorithms
作者： David E. Goldberg , Kalyanmoy Deb
DOI: 10.1016/B978-0-08-050684-5.50008-2
关键词:
摘要: This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, …
elsevier.com
sci-hub.se 
unr.edu 参考文章(19)
David E. Goldberg, Philip Segrest, Finite Markov chain analysis of genetic algorithms international conference on genetic algorithms. pp. 1- 8 ,(1987)
David E. Goldberg, A Note on Boltzmann Tournament Selection for Genetic Algorithms and Population-Oriented Simulated Annealing. Complex Systems. ,vol. 4, ,(1990)
James E. Baker, John J. Greffenstette, How Genetic Algorithms Work: A Critical Look at Implicit Parallelism international conference on genetic algorithms. pp. 20- 27 ,(1989)
John H. Holland, Adaptation in natural and artificial systems ,(1992)
L. Darrell Whitley, The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best international conference on genetic algorithms. pp. 116- 123 ,(1989)
David E. Goldberg, Robert E. Smith, Nonstationary function optimization using genetic algorithm with dominance and diploidy international conference on genetic algorithms. pp. 59- 68 ,(1987)
David E. Goldberg, Kalyanmoy Deb, An Investigation of Niche and Species Formation in Genetic Function Optimization international conference on genetic algorithms. pp. 42- 50 ,(1989)
Carol A. Ankenbrandt, An Extension To the Theory of Convergence and a Proof of the Time Complexity of Genetic Algorithms Foundations of Genetic Algorithms. ,vol. 1, pp. 53- 68 ,(1991) , 10.1016/B978-0-08-050684-5.50007-0
David E. Goldberg, Sizing Populations for Serial and Parallel Genetic Algorithms international conference on genetic algorithms. pp. 70- 79 ,(1989)
Bradley Korb, David E. Goldberg, Kalyanmoy Deb, Messy genetic algorithms: motivation, analysis, and first results Complex Systems. ,vol. 3, ,(1989)