A Self-Selecting Crossover Operator

This paper compares the efficacy of different crossover operators for Grammatical Evolution across a typical numeric regression problem and a typical data classification problem. Grammatical evolution is an extension of genetic programming, in that it is an algorithm for evolving complete programs in an arbitrary language. Each of the two main crossover operators struggles (for different reasons) to achieve 100% correct solutions. A mechanism is proposed, allowing the evolutionary algorithm to self-select the type of crossover utilised and this is shown to improve the rate of generating 100% successful solutions.

[1]  Dana H. Ballard,et al.  Genetic Programming with Adaptive Representations , 1994 .

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

[3]  Peter J. Angeline,et al.  Adaptive and Self-adaptive Evolutionary Computations , 1995 .

[4]  David J. Montana,et al.  Strongly Typed Genetic Programming , 1995, Evolutionary Computation.

[5]  Bull,et al.  An Overview of Genetic Algorithms: Part 2, Research Topics , 1993 .

[6]  Peter J. Angeline,et al.  Genetic programming and emergent intelligence , 1994 .

[7]  Shengxiang Yang Adaptive crossover in genetic algorithms using statistics mechanism , 2002 .

[8]  William M. Spears,et al.  Adapting Crossover in Evolutionary Algorithms , 1995, Evolutionary Programming.

[9]  Conor Ryan,et al.  Ripple Crossover in Genetic Programming , 2001, EuroGP.

[10]  Alan Blair,et al.  A structure preserving crossover in grammatical evolution , 2005, 2005 IEEE Congress on Evolutionary Computation.

[11]  Peter A. Whigham,et al.  Grammatically-based Genetic Programming , 1995 .

[12]  Michael O'Neill,et al.  Grammatical Evolution: Evolving Programs for an Arbitrary Language , 1998, EuroGP.

[13]  Riccardo Poli,et al.  On the Search Properties of Different Crossover Operators in Genetic Programming , 2001 .

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

[15]  W. Banzhaf,et al.  Genetic programming using genotype-phenotype mapping from linear genomes into linear phenotypes , 1996 .