Diversity maintenance on neutral landscapes: an argument for recombination

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.

[1]  K. Holsinger.  The neutral theory of molecular evolution , 2004 .

[2]  M. Kimura.  The Neutral Theory of Molecular Evolution: Introduction , 1983 .

[3]  J. Crutchfield,et al.  Optimizing Epochal Evolutionary Search: Population-Size Dependent Theory , 1998, Machine-mediated learning.

[4]  L. Barnett.  TANGLED WEBS Evolutionary Dynamics on Fitness Landscapes with Neutrality , 1997 .

[5]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6]  Melanie Mitchell,et al.  The royal road for genetic algorithms: Fitness landscapes and GA performance , 1991 .

[7]  Alan S. Perelson,et al.  Searching for Diverse, Cooperative Populations with Genetic Algorithms , 1993, Evolutionary Computation.

[8]  D. Goldberg,et al.  Escaping hierarchical traps with competent genetic algorithms , 2001 .

[9]  M. Newman,et al.  Effects of neutral selection on the evolution of molecular species , 1997, adap-org/9712005.

[10]  G. Ochoa,et al.  On sex, mate selection and the red queen. , 1999, Journal of theoretical biology.

[11]  N. Takahata.  Neutral theory of molecular evolution. , 1996, Current opinion in genetics & development.

[12]  M. Newman,et al.  Effects of selective neutrality on the evolution of molecular species , 1998, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[13]  Lionel Barnett,et al.  Netcrawling-optimal evolutionary search with neutral networks , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[14]  J. Pollack,et al.  Hierarchically consistent test problems for genetic algorithms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[15]  S Hendry,et al.  Searching for diversity. , 1997, Australian nursing journal (July 1993).

[16]  Melanie Mitchell,et al.  Relative Building-Block Fitness and the Building Block Hypothesis , 1992, FOGA.

[17]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[18]  John H. Holland,et al.  Building Blocks, Cohort Genetic Algorithms, and Hyperplane-Defined Functions , 2000, Evolutionary Computation.