Evolving binary decision diagrams using implicit neutrality

A new algorithm is presented for evolving binary decision diagrams (BDD) that employs the neutrality implicit in the BDD representation. It is shown that an effortless neutral walk is taken; that is, a neutral walk that requires no fitness evaluations. Experiments show the algorithm to be robust and scalable across a range of n-parity problems up to n = 17, and highly efficient on a range of other functions with compact BDD representations. Evolvability and modularity issues are also discussed, and the search space is shown to be free of local optima.

[1]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[2]  Wolfgang Banzhaf,et al.  Genetic Programming: An Introduction , 1997 .

[3]  Hitoshi Iba,et al.  Evolution of Binary Decision Diagrams for Digital Circuit Design Using Genetic Programming , 1996, ICES.

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

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

[6]  M. Yanagiya,et al.  Efficient genetic programming based on binary decision diagrams , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

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

[8]  L. Barnett.  Ruggedness and neutrality—the NKp family of fitness landscapes , 1998 .

[9]  Julian Francis Miller,et al.  Cartesian genetic programming , 2000, GECCO '10.

[10]  L. Altenberg.  The evolution of evolvability in genetic programming , 1994 .

[11]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[12]  R. Bryant.  Graph-Based Algorithms for Boolean Function Manipulation12 , 1986 .

[13]  John R. Woodward,et al.  Modularity in Genetic Programming , 2003, EuroGP.

[14]  Julian Francis Miller,et al.  Finding Needles in Haystacks Is Not Hard with Neutrality , 2002, EuroGP.

[15]  Günter P. Wagner,et al.  Complex Adaptations and the Evolution of Evolvability , 2005 .

[16]  Marc Ebner,et al.  On neutral networks and evolvability , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[17]  Piet van Remortel,et al.  The Evolution of ROBDDs: Preliminary Results and a First Analysis , 1999, Evolvable Hardware.

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

[19]  C. Y. Lee.  Representation of switching circuits by binary-decision programs , 1959 .

[20]  Valentin Goranko,et al.  Logic in Computer Science: Modelling and Reasoning About Systems , 2007, J. Log. Lang. Inf..

[21]  Christian Miccio.  Parallel Genetic Programming Induction of Binary Decision Diagrams , .