Zipper-based Meta-Genetic Programming

We present a zipper-based instruction set for constructing genetic programming variation operators. We study the effects of such variation operators on the lawnmower problem. Operators in this language possess the ability to outperform standard mutation and crossover in terms of both decreasing the average population error as well as the best population error. Furthermore, the expression of standard mutation and crossover in this language is trivial, allowing evolution to re-discover these operators when necessary. We conclude by using these operators in a meta-genetic programming context, showing that it is possible for zipper-based metagenetic programming to expedite evolutionary search.

[1]  WHEN DARWIN,et al.  The Origin of Life , 2019, Rethinking Evolution.

[2]  Wolfgang Banzhaf,et al.  Meta-Evolution in Graph GP , 1999, EuroGP.

[3]  Bruce Edmonds,et al.  Meta-Genetic Programming: Co-evolving the Operators of Variation , 2001 .

[4]  Compositional Autoconstructive Dynamics , 2011 .

[5]  Richard A. Watson,et al.  Variable discrimination of crossover versus mutation using parameterized modular structure , 2007, GECCO '07.

[6]  John R. Koza,et al.  Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems , 1990 .

[7]  M W Feldman,et al.  Selection, generalized transmission and the evolution of modifier genes. I. The reduction principle. , 1987, Genetics.

[8]  Peter J. Angeline,et al.  Two self-adaptive crossover operators for genetic programming , 1996 .

[9]  Lawrence Davis,et al.  Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.

[10]  Julian Francis Miller,et al.  Embedded cartesian genetic programming and the lawnmower and hierarchical-if-and-only-if problems , 2006, GECCO.

[11]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  William B. Langdon,et al.  Repeated patterns in genetic programming , 2008, Natural Computing.

[13]  Anthony Brabazon,et al.  mGGA: The meta-Grammar Genetic Algorithm , 2005, EuroGP.

[14]  David B. Fogel,et al.  Meta-evolutionary programming , 1991, [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers.

[15]  Lee Spector,et al.  Genetic Programming and Autoconstructive Evolution with the Push Programming Language , 2002, Genetic Programming and Evolvable Machines.

[16]  Una-May O'Reilly,et al.  Genetic Programming II: Automatic Discovery of Reusable Programs. , 1994, Artificial Life.

[17]  U. Alon,et al.  Spontaneous evolution of modularity and network motifs. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[18]  Robert M. MacCallum,et al.  Introducing a Perl Genetic Programming System - and Can Meta-evolution Solve the Bloat Problem? , 2003, EuroGP.

[19]  Astro Teller,et al.  Evolving programmers: the co-evolution of intelligent recombination operators , 1996 .

[20]  S. Luke.  When short runs beat long runs , 2001 .

[21]  Lee Spector,et al.  Cultural transmission of information in genetic programming , 1996 .

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

[23]  Lee Spector,et al.  Tag-based modules in genetic programming , 2011, GECCO '11.

[24]  Igor Durdanovic,et al.  Toward Code Evolution by Artificial Economies , 2002 .

[25]  Riccardo Poli,et al.  Exact Schema Theory for Genetic Programming and Variable-Length Genetic Algorithms with One-Point Crossover , 2001, Genetic Programming and Evolvable Machines.

[26]  Rich Hickey,et al.  The Clojure programming language , 2008, DLS '08.

[27]  Lee Spector,et al.  Towards Practical Autoconstructive Evolution: Self-Evolution of Problem-Solving Genetic Programming Systems , 2011 .

[28]  John H. Holland,et al.  Properties of the Bucket Brigade , 1985, ICGA.