Semantically driven mutation in genetic programming

Using semantic analysis, we present a technique known as semantically driven mutation which can explicitly detect and apply behavioural changes caused by the syntactic changes in programs that result from the mutation operation. Using semantically driven mutation, we demonstrate increased performance in genetic programming on seven benchmark genetic programming problems over two different domains.

[1]  Fabio Somenzi,et al.  CUDD: CU Decision Diagram Package Release 2.2.0 , 1998 .

[2]  Peter J. Angeline,et al.  Explicitly Defined Introns and Destructive Crossover in Genetic Programming , 1996 .

[3]  Mark J. Willis,et al.  Using a tree structured genetic algorithm to perform symbolic regression , 1995 .

[4]  P. Angeline.  An Investigation into the Sensitivity of Genetic Programming to the Frequency of Leaf Selection Duri , 1996 .

[5]  S. Minato.  Implicit manipulation of polynomials using zero-suppressed BDDs , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

[6]  K. Kinnear.  Fitness landscapes and difficulty in genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[7]  Colin G. Johnson,et al.  Semantically driven crossover in genetic programming , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[8]  N. Hopper,et al.  Analysis of genetic diversity through population history , 1999 .

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

[10]  Lee Spector,et al.  A Revised Comparison of Crossover and Mutation in Genetic Programming , 1998 .

[11]  K. E. Kinnear,et al.  Evolving a sort: lessons in genetic programming , 1993, IEEE International Conference on Neural Networks.

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

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

[14]  Riccardo Poli,et al.  Foundations of Genetic Programming , 1999, Springer Berlin Heidelberg.

[15]  Riccardo Poli,et al.  A Field Guide to Genetic Programming , 2008 .

[16]  Riccardo Poli,et al.  On the Limiting Distribution of Program Sizes in Tree-Based Genetic Programming , 2007, EuroGP.

[17]  Sean Luke,et al.  Modification Point Depth and Genome Growth in Genetic Programming , 2003, Evolutionary Computation.

[18]  Sean Luke,et al.  Code Growth Is Not Caused by Introns , 2000 .

[19]  Nicholas Freitag McPhee,et al.  Semantic Building Blocks in Genetic Programming , 2008, EuroGP.

[20]  Terence Soule,et al.  An Analysis of the Causes of Code Growth in Genetic Programming , 2002, Genetic Programming and Evolvable Machines.

[21]  W. Langdon.  The evolution of size in variable length representations , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[22]  Richard Mark Downing,et al.  Evolving binary decision diagrams using implicit neutrality , 2005, 2005 IEEE Congress on Evolutionary Computation.

[23]  Steven M. Gustafson.  An analysis of diversity in genetic programming , 2004 .

[24]  Conor Ryan,et al.  Context-aware mutation: a modular, context aware mutation operator for genetic programming , 2007, GECCO '07.