Fitness Causes Bloat: Mutation

The problem of evolving, using mutation, an artificial ant to follow the Santa Fe trail is used to study the well known genetic programming feature of growth in solution length. Known variously as

[1]  William B. Langdon.  Data structures and genetic programming , 1995 .

[2]  D. Ballard,et al.  Complexity Drift in Evolutionary Computation with Tree Representations , 1996 .

[3]  Thomas Haynes,et al.  Duplication of Coding Segments in Genetic Programming , 1996, AAAI/IAAI, Vol. 1.

[4]  Lee Altenberg,et al.  The Schema Theorem and Price's Theorem , 1994, FOGA.

[5]  Justinian P. Rosca,et al.  Discovery of subroutines in genetic programming , 1996 .

[6]  P. Ross,et al.  An adverse interaction between crossover and restricted tree depth in genetic programming , 1996 .

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

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

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

[10]  Walter Alden Tackett,et al.  Genetic Programming for Feature Discovery and Image Discrimination , 1993, ICGA.

[11]  Riccardo Poli,et al.  Why Ants are Hard , 1998 .

[12]  Tobias Blickle,et al.  Theory of evolutionary algorithms and application to system synthesis , 1997 .

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

[14]  Lothar Thiele,et al.  Genetic Programming and Redundancy , 1994 .

[15]  Riccardo Poli,et al.  Fitness Causes Bloat , 1998 .

[16]  Peter Nordin,et al.  Complexity Compression and Evolution , 1995, ICGA.

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

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

[19]  Riccardo Poli,et al.  On the Ability to Search the Space of Programs of Standard, One-point and Uniform Crossover in Genetic Programming , 1998 .

[20]  Walter Alden Tackett,et al.  Greedy Recombination and Genetic Search on the Space of Computer Programs , 1994, FOGA.

[21]  Peter Ross,et al.  Dynamic Training Subset Selection for Supervised Learning in Genetic Programming , 1994, PPSN.

[22]  Nicholas Freitag McPhee,et al.  Accurate Replication in Genetic Programming , 1995, ICGA.

[23]  George R. Price,et al.  Selection and Covariance , 1970, Nature.

[24]  WB Langdon.  Evolving Data Structures Using Genetic Programming , 1995 .

[25]  W. Langdon.  An Analysis of the MAX Problem in Genetic Programming , 1997 .

[26]  Byoung-Tak Zhang,et al.  Evolving Optimal Neural Networks Using Genetic Algorithms with Occam's Razor , 1993, Complex Syst..

[27]  Walter Alden Tackett,et al.  Recombination, selection, and the genetic construction of computer programs , 1994 .

[28]  Annie S. Wu,et al.  A Survey of Intron Research in Genetics , 1996, PPSN.

[29]  Hitoshi Iba,et al.  Genetic programming using a minimum description length principle , 1994 .