Conference Proceedings
Diversity maintenance on neutral landscapes: An argument for recombination
N Geard, J Wiles
Proceedings of the 2002 Congress on Evolutionary Computation CEC 2002 | IEEE | Published : 2002
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 transitio..
View full abstract