DocumentCode :
1651768
Title :
Diversity maintenance on neutral landscapes: an argument for recombination
Author :
Geard, Nicholas ; Wiles, Janet
Author_Institution :
Sch. of Inf. Technol. & Electr. Eng., Univ. of Queensland, Brisbane, Qld., Australia
Volume :
1
fYear :
2002
Firstpage :
211
Lastpage :
213
Abstract :
It has been demonstrated that several standard evolutionary computation test problems can be solved by a simple hill climbing search algorithm-often more efficiently than by a population based evolutionary algorithm. There remain some classes of problems, however, for which maintaining a genetically diverse population is essential in order to discover the optimal solution. In biological populations, diversity maintenance is important to enable populations to adapt to rapidly changing environments and to exploit environmental niches. We demonstrate that on a neutral landscape recombination allows a population to maintain a significantly greater level of genetic diversity through the transition between two fitness layers. Recombination may therefore have a role to play in maintaining population diversity across fitness transitions
Keywords :
evolutionary computation; search problems; diversity maintenance; evolutionary computation test problems; genetically diverse population; hill climbing search algorithm; neutral landscape recombination; neutral landscapes; Australia; Biological system modeling; Convergence; Evolution (biology); Evolutionary computation; Genetic mutations; Immune system; Information technology; Psychology; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on
Conference_Location :
Honolulu, HI
Print_ISBN :
0-7803-7282-4
Type :
conf
DOI :
10.1109/CEC.2002.1006235
Filename :
1006235
Link To Document :
بازگشت