An Empirical Comparison of Selection Methods in Evolutionary Algorithms

Abstract

Selection methods in Evolutionary Algorithms, including Genetic Algorithms, Evolution Strategies (ES) and Evolutionary Programming, (EP) are compared by observing the rate of convergence on three idealised problems. The first considers selection only, the second introduces mutation as a source of variation, the third also adds in evaluation noise. Fitness proportionate selection suffers from scaling problems: a number of techniques to reduce these are illustrated. The sampling errors caused by roulette wheel and tournament selection are demonstrated. The EP selection model is shown to be almost equivalent to an ES model in one form, and surprisingly similar to fitness proportionate selection in another. Generational models are shown to be remarkably immune to evaluation noise, models that retain parents much less so. 1 Introduction Selection provides the driving force in an evolutionary algorithm (EA) and the selection pressure is a critical parameter. Too much, and the search will te..