A comparison of selection schemes used in evolutionary algorithms

Evolutionary Computation

Volumn 4, Issue 4, 1996, Pages 361-394

  Blickle, Tobias ^a   Thiele, Lothar ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Diversity; Evolutionary algorithms; Genetic algorithms; Linear ranking; Selection; Selection intensity; Tournament selection; Truncation selection

Indexed keywords

EID: 4644293749     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/evco.1996.4.4.361     Document Type: Article

References (18)

1. Arnold, B. G, Balakrishnan, N., & Nagaraja, H. N. (1992). A first course in order statistics. New York: Wiley.
2. Bäck, T. (1994a). Evolutionary algorithms in theory and practice. Unpublished doctoral dissertation, Fachbereich Informatik, Universität Dortmund, Germany.
3. Back, T. (1994b). Selective pressure in evolutionary algorithms: A characterization of selection mechanisms. In Proceedings of the First IEEE Conference on Evolutionary Computation (pp. 57-62). Piscataway, NJ: IEEE Press.
4. Back, T. (1995). Generalized convergence models for tournament- and (μ, A)-selection. In L. Eshelman (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms (pp. 2-8). San Francisco, CA: Morgan Kaufmann.
5. Baker, J. E. (1987). Reducing bias and inefficiency in the selection algorithm. In J. Grefenstette (Ed.), Genetic algorithms and their applications: Proceedings of the Second International Conference on Genetic Algorithms and Their Applications (pp. 14-21), Hillsdale, NJ: Lawrence Erlbaum.
6. Baker, J. E. (1989). An analysis of the effects of selection in genetic algorithms. Unpublished doctoral dissertation, Graduate School of Vanderbilt University, Nashville, Tennessee.
7. Buckle, T. (1996). Theory of evolutionary algorithms and application to system-synthesis (Doctoral dissertation, Swiss Federal Institute of Technology [ETH] Zurich, Switzerland, 1996, ETH dissertation no. 11894). Zurich: VDF-Verlag Zurich.
8. Blickle, T., & Thiele, L. (1995). A mathematical analysis of tournament selection. In L. Eshelman (Ed.), Proceedings of the Sixth International Conference on Genetic Algorithms (pp. 9-16). San Francisco, CA: Morgan Kaufmann.
9. Bulmer, M. G. (1980). The mathematical theory of'quantitative genetics. Oxford: Clarendon Press.
10. Crow, J. F., & Kimura, M. (1970). An introduction to population genetics theory. New York: Harper and Row.
11. De la Maza, M., & Tidor, B. (1993). An analysis of selection procedures with particular attention paid to proportional and Boltzmann selection. In S. Forrest (Ed.), Proceedings of the Fifth International Conference on Genetic Algorithms (pp. 124-131). San Mateo, CA: Morgan Kaufmann.
12. Goldberg, D. E., & Deb, K. (1991). A comparative analysis of selection schemes used in genetic algorithms. In G. Rawlins (Ed.), Foundations of genetic algorithms (pp. 69-93). San Mateo, CA: Morgan Kaufmann.
13. Grefenstette, J. J., & Baker, J. E. (1989). How genetic algorithms work: A critical look at implicit parallelism. In J. D. Schaffer (Ed.), Proceedings of the Third International Conference on Genetic Algorithms (pp. 20-27). San Mateo, CA: Morgan Kaufmann.
14. Koza, J. R. (1992). Genetic programming: On the programming of computers by means of natural selection. Cambridge, MA: MIT Press.
15. Miller, B. L. & Goldberg, D. E. (1995). Genetic algorithms, tournament selection, and the effects of noise (Tech. Rep. No. 95006). Urbana, IL: University of Illinois, The Illinois Genetic Algorithm Laboratory.
16. Aluhlenbein, H., & Schlierkamp-Voosen, D. (1993). Predictive models for the breeder genetic algorithm. Evolutionary Computation, 7(1), 25-49.
17. Nagaraja, H. (1982). Selection differentials. In S. Kotz & N. L. Johnson (Eds.), Encyclopedia of statistical science (pp. 334-336). New York: Wiley.
18. Shapiro, J., Priigel-Bennett, A., & Rattray, M. (1994). A statistical mechanical formulation of the dynamics of genetic algorithms. In T. C. Fogarty (Ed.), Evolutionary computing AISB trorkshop (pp. 17-27). Berlin: Springer-Verlag.