Size fair and homologous tree genetic programming crossovers

Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program size and no detrimental effect on GP performance. GP search spaces are partitioned by the ridge in the number of program v. their size and depth. A ramped uniform random initialisation is described which straddles the ridge. With subtree crossover trees increase about one level per generation leading to sub-quadratic bloat in length.

[1]  John R. Koza,et al.  Genetic Programming II , 1992 .

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

[3]  Patrik D'haeseleer,et al.  Context preserving crossover in genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[4]  Philippe Flajolet,et al.  An introduction to the analysis of algorithms , 1995 .

[5]  René Schott,et al.  Random generation of trees - random generators in computer science , 1995 .

[6]  L. Alonso,et al.  Random Generation of Trees , 1995, Springer US.

[7]  Hitoshi Iba,et al.  Random Tree Generation for Genetic Programming , 1996, PPSN.

[8]  Terence Soule,et al.  Code growth in genetic programming , 1996 .

[9]  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).

[10]  Riccardo Poli,et al.  Schema Theory for Genetic Programming with One-Point Crossover and Point Mutation , 1997, Evolutionary Computation.

[11]  Terence Soule,et al.  Removal bias: a new cause of code growth in tree based evolutionary programming , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[12]  Riccardo Poli,et al.  Genetic Programming Bloat with Dynamic Fitness , 1998, EuroGP.

[13]  Riccardo Poli,et al.  Sub-machine-code genetic programming , 1999 .

[14]  Wolfgang Banzhaf,et al.  Efficient evolution of machine code for CISC architectures using instruction blocks and homologous crossover , 1999 .

[15]  Riccardo Poli,et al.  The evolution of size and shape , 1999 .