A Comparison of Crossover and Mutation in Genetic Programming

This paper presents a large and systematic body of data on the relative effectiveness of mutation, crossover, and combinations of mutation and crossover in genetic programming (GP). The literature of traditional genetic algorithms contains related studies, but mutation and crossover in GP differ from their traditional counterparts in significant ways. In this paper we present the results from a very large experimental data set, the equivalent of approximately 12,000 typical runs of a GP system, systematically exploring a range of parameter settings. The resulting data may be useful not only for practitioners seeking to optimize parameters for GP runs, but also for theorists exploring issues such as the role of “building blocks” in GP.

[1]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[2]  Larry J. Eshelman,et al.  On Crossover as an Evolutionarily Viable Strategy , 1991, ICGA.

[3]  William M. Spears,et al.  Crossover or Mutation? , 1992, FOGA.

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

[5]  Alice E. Smith,et al.  Expected Allele Coverage and the Role of Mutation in Genetic Algorithms , 1993, ICGA.

[6]  Astro Teller,et al.  The evolution of mental models , 1994 .

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

[8]  Una-May O'Reilly,et al.  The Troubling Aspects of a Building Block Hypothesis for Genetic Programming , 1994, FOGA.

[9]  Thomas C. Peachey,et al.  The Nature of Mutation in Genetic Algorithms , 1995, ICGA.

[10]  Hitoshi Iba,et al.  Extending genetic programming with recombinative guidance , 1996 .

[11]  Astro Teller,et al.  A study in program response and the negative effects of introns in genetic programming , 1996 .

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

[13]  Peter Nordin,et al.  The Effect of Extensive Use of the Mutation Operator on Generalization in Genetic Programming Using Sparse Data Sets , 1996, PPSN.

[14]  Una-May O'Reilly,et al.  A comparative analysis of genetic programming , 1996 .

[15]  Peter J. Angeline,et al.  A Comparative Analysis of Genetic Programming , 1996 .

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

[17]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.