Title :
Extrema selection: accelerated evolution on neutral networks
Author_Institution :
Inst. of Interdisciplinary Studies, Carleton Univ., Ottawa, Ont., Canada
Abstract :
A new modification to the genetic algorithm is presented which is specifically designed to increase the rate of evolution on fitness functions with high degrees of neutrality (mutations that do not change the individual´s fitness). Instead of allowing random genetic drift to occur when most of the population has reached the same fitness, the “reproduction fitness” of individuals is set to their distance from the population centroid. This has the theoretical effect of spreading the population quickly across the neutral network, and thus finding regions of higher fitness more quickly than it mould otherwise. A series of experiments is described which shows a significant improvement in using this method on the NKp family of fitness functions, and show that this improvement is correlated with the degree of neutrality
Keywords :
functions; genetic algorithms; NKp family; accelerated evolution; extrema selection; fitness functions; genetic algorithm; genetic drift; neutral mutations; neutral networks; population centroid distance; population spread; reproduction fitness; Acceleration; Algorithm design and analysis; Cognitive science; Convergence; Genetic algorithms; Genetic mutations; Genomics; Proteins; RNA; Sequences;
Conference_Titel :
Evolutionary Computation, 2001. Proceedings of the 2001 Congress on
Conference_Location :
Seoul
Print_ISBN :
0-7803-6657-3
DOI :
10.1109/CEC.2001.934366