On the Utility of Redundant Encodings in Mutation-Based Evolutionary Search

A number of recent works in the evolutionary computation field have suggested that introducing large amounts of genetic redundancy may increase the evolvability of a population in an evolutionary algorithm. These works have variously claimed that the reliability of the search, the final fitness achieved, the ability to cope with changing environments, and the robustness to high mutation rates, may all be improved by employing this strategy. In this paper we dispute some of these claims, arguing that adding random redundancy cannot be generally useful for optimization purposes. By way of example we report on experiments where a proposed neutral encoding scheme (based on random Boolean networks) is compared to a direct encoding in two mutation-only EAs, at various mutation rates. Our findings show that with the appropriate choice of per-bit mutation rate, the evolvability of populations using the direct encoding is no less than with the redundant one.

[1]  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).

[2]  Julian Francis Miller,et al.  The Advantages of Landscape Neutrality in Digital Circuit Evolution , 2000, ICES.

[3]  Daniel L. Stein,et al.  Lectures In The Sciences Of Complexity , 1989 .

[4]  Christian M. Reidys,et al.  Neutrality in fitness landscapes , 2001, Appl. Math. Comput..

[5]  Richard A. Watson,et al.  Analysis of recombinative algorithms on a non-separable building-block problem , 2000, FOGA.

[6]  M. Kimura,et al.  The neutral theory of molecular evolution. , 1983, Scientific American.

[7]  Jordan B. Pollack,et al.  Modeling Building-Block Interdependency , 1998, PPSN.

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

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

[10]  S Bornholdt,et al.  Robustness as an evolutionary principle , 2000, Proceedings of the Royal Society of London. Series B: Biological Sciences.

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

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

[13]  Marc Ebner,et al.  How neutral networks influence evolvability , 2001, Complex..

[14]  Julian Francis Miller,et al.  Neutrality and the Evolvability of Boolean Function Landscape , 2001, EuroGP.

[15]  Seth Bullock,et al.  Smooth Operator? Understanding and Visualising Mutation Bias , 2001, ECAL.

[16]  J. Crutchfield,et al.  Metastable evolutionary dynamics: Crossing fitness barriers or escaping via neutral paths? , 1999, Bulletin of mathematical biology.

[17]  Inman Harvey,et al.  Through the Labyrinth Evolution Finds a Way: A Silicon Ridge , 1996, ICES.