On the Influence of Selection Schemes on the Genetic Diversity in Genetic Algorithms
This paper discusses some aspects of the general convergence behavior of genetic algorithms. Careful attention is given to how different selection strategies influence the progress of genetic diversity in populations. For being able to observe genetic diversity over time measures are introduced for estimating pairwise similarities as well as similarities among populations; these measures allow different perspectives to the similarity distribution of a genetic algorithm’s population during its execution. The similarity distribution of populations is illustrated exemplarily on the basis of some routing problem instances.
KeywordsGenetic Algorithm Travel Salesman Problem Travel Salesman Problem Success Ratio Premature Convergence
Unable to display preview. Download preview PDF.
- 1.Affenzeller, M., Wagner, S.: Offspring selection: A new self-adaptive selection scheme for genetic algorithms. In: Ribeiro, B., Albrecht, R.F., Dobnikar, A., Pearson, D.W., Steele, N.C. (eds.) Adaptive and Natural Computing Algorithms. Springer Computer Science, pp. 218–221. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 5.Rechenberg, I.: Evolutionsstrategie. Friedrich Frommann Verlag (1973)Google Scholar