Selection Schemes in Evolutionary Algorithms

Wojciech Wieczorek, Zbigniew J. Czech · 2002

One of the steps of an evolutionary algorithm is selection which chooses some individuals from a current population as parents to the individuals of the next population. This work focuses on loss of population diversity defined as the proportion of population individuals which are not chosen during selection. Quantifying loss of population diversity is crucial for designing evolutionary algorithms in which the search process is directed through controlling population diversity via parameters of a selection scheme. The aim of this work is to derive closed, approximate formulas which enable to determine loss of population diversity for some selection schemes. The selection schemes under consideration are also compared with respect to effectiveness and ease of controlling population diversity.

Read the paper · More papers on PaperTik