On neutral networks and evolvability

Evolutionary algorithms apply the processes of variation, reproduction and selection to look for an individual that is capable of solving the task in hand. In order to improve the evolvability of a population, we propose to copy important characteristics of nature's search space. Desired characteristics for a genotype-phenotype mapping are described, and several highly redundant genotype-phenotype mappings are analyzed in the context of a population-based search. We show that evolvability is influenced by the existence of neutral networks in the genotype space. The extent of the neutral networks affects the interconnectivity of the search space and thereby affects evolvability. Species evolving on a non-redundant mapping reach a state of stasis after a few generations; in effect, evolution comes to a halt. However, species evolving on a genotype-phenotype mapping with extensive neutral networks are continuously able to find adaptive mutations and are able to locate higher optima. The existence of highly intertwined neutral networks increases the evolvability of a population.

[1]  James R. Levenick,et al.  Swappers: introns promote flexibility, diversity and invention , 1999 .

[2]  Peter Schuster,et al.  Extended Molecular Evolutionary Biology: Artificial Life Bridging the Gap Between Chemistry and Biology , 1993, Artificial Life.

[3]  R. Shipman,et al.  Genetic Redundancy: Desirable or Problematic for Evolutionary Adaptation? , 1999, ICANNGA.

[4]  Wolfgang Banzhaf,et al.  The evolution of genetic code in Genetic Programming , 1999 .

[5]  M. Ebner On the search space of genetic programming and its relation to nature's search space , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[6]  S. Gould,et al.  Punctuated equilibria: an alternative to phyletic gradualism , 1972 .

[7]  M. Huynen,et al.  Smoothness within ruggedness: the role of neutrality in adaptation. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Stephen Wolfram,et al.  Cellular automata as models of complexity , 1984, Nature.

[9]  M. Shackleton,et al.  An investigation of redundant genotype-phenotype mappings and their role in evolutionary search , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[10]  Moshe Sipper,et al.  Evolution of Parallel Cellular Machines , 1997, Lecture Notes in Computer Science.

[11]  N. Packard,et al.  Neutral search spaces for artificial evolution: a lesson from life , 2000 .

[12]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[13]  Wolfgang Banzhaf,et al.  Genotype-Phenotype-Mapping and Neutral Variation - A Case Study in Genetic Programming , 1994, PPSN.

[14]  R. Dawkins The Blind Watchmaker , 1986 .

[15]  Peter Schuster,et al.  Artificial Life and Molecular Evolutionary Biology , 1995, ECAL.

[16]  S. Wolfram Statistical mechanics of cellular automata , 1983 .

[17]  M. Huynen,et al.  Neutral evolution of mutational robustness. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[18]  R. Lenski,et al.  Punctuated Evolution Caused by Selection of Rare Beneficial Mutations , 1996, Science.

[19]  Moshe Sipper,et al.  Evolution of Parallel Cellular Machines: The Cellular Programming Approach , 1997 .

[20]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.