A depth controlling strategy for Strongly Typed Evolutionary Programming

This paper presents a dynamic strategy for monitoring the depth of program trees evolved by STEPS (Strongly Typed Evolutionary Programming System). STEPS evolves higher-order functional programs in the form of trees, which are allowed to grow or shrink to fit the size of the problem, via specialised genetic operators. Thus, the need for arbitrary cut-off mechanisms is eliminated.

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

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

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

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

[5]  John W. Lloyd,et al.  Declarative Programming in Escher , 1995 .

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

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

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

[9]  Tobias Blickle,et al.  Evolving Compact Solutions in Genetic Programming: A Case Study , 1996, PPSN.

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

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

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

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

[14]  Christopher Gathercole,et al.  An investigation of supervised learning in genetic programming , 1998 .

[15]  Peter A. Flach,et al.  Strongly Typed Inductive Concept Learning , 1998, ILP.

[16]  Christophe Giraud-Carrier,et al.  An Evolutionary Approach to Concept Learning with Structured Data , 1999, ICANNGA.