DocumentCode :
296199
Title :
The role of selection in evolutionary algorithms
Author :
Kolarov, Krasimir
Author_Institution :
Interval Res. Corp., Palo Alto, CA, USA
Volume :
1
fYear :
1996
fDate :
29 Nov-1 Dec 1996
Firstpage :
86
Abstract :
The primary goal of this paper is to understand the dynamics of interaction in a population of individuals using a simple but representative evolutionary approach. The paper studies the effect of different parameters, like population size, strength of selection and different selection regimes, on the performance of an evolutionary algorithm in terms of speed of fixation and fixation to suboptimal individuals. It looks at evolution as a process of adaptation rather than an optimization, thus the evolutionary model is closer to the population genetics approach than to the most commonly used genetic algorithm model
Keywords :
genetic algorithms; search problems; adaptation; evolutionary algorithms; evolutionary approach; fixation speed; genetic algorithm; interaction dynamics; optimization; performance; population; population genetics; population size; selection; selection regimes; suboptimal individuals; Biological cells; Evolutionary computation; Genetic algorithms; Genetic mutations; Milling machines; Organisms; Performance analysis; Sampling methods; Stochastic processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 1995., IEEE International Conference on
Conference_Location :
Perth, WA
Print_ISBN :
0-7803-2759-4
Type :
conf
DOI :
10.1109/ICEC.1995.489124
Filename :
489124
Link To Document :
بازگشت