GENETIC PROGRAMMING: A CURRENT SNAPSHOT

Genetic programming is a promising variant of genetic algorithms that evolves dynamic, hierarchical structures often described as programs. Genetic programming’s flexibility to tailor the representation language to the problem being solved, and its specially designed crossover operator provide a robust tool for evolving problem solutions. This paper provides an introduction to genetic programming, a short review of dynamic representations used in evolutionary systems and their relation to genetic programming, and a description of some of genetic programming’s inherent properties. The paper concludes with a review of on going research and some potential future directions for the field.

[1]  Justinian P. Rosca,et al.  Learning by adapting representations in genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[2]  John H. Holland,et al.  Adaptation in natural and artificial systems , 1975 .

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

[4]  Zbigniew Michalewicz,et al.  A Hierarchy of Evolution Programs: An Experimental Study , 1993, Evolutionary Computation.

[5]  J. K. Kinnear,et al.  Alternatives in automatic function definition: a comparison of performance , 1994 .

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

[7]  John Dickinson,et al.  Using the Genetic Algorithm to Generate LISP Source Code to Solve the Prisoner's Dilemma , 1987, ICGA.

[8]  J. Pollack,et al.  Coevolving High-Level Representations , 1993 .

[9]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[10]  Melanie Mitchell,et al.  Relative Building-Block Fitness and the Building Block Hypothesis , 1992, FOGA.

[11]  Craig W. Reynolds.  An Evolved, Vision-Based Model of Obstacle Avoidance Behavior , 1994 .

[12]  Timothy Perkis,et al.  Stack-based genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[13]  Nichael Lynn Cramer,et al.  A Representation for the Adaptive Generation of Simple Sequential Programs , 1985, ICGA.

[14]  James R. Levenick.  Inserting Introns Improves Genetic Algorithm Success Rate: Taking a Cue from Biology , 1991, ICGA.

[15]  Peter J. Angeline.  Evolutionary algorithms and emergent intelligence , 1993 .

[16]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[17]  L. Altenberg.  The evolution of evolvability in genetic programming , 1994 .

[18]  Ingo Rechenberg,et al.  Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .

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

[20]  Thomas Bäck,et al.  A Survey of Evolution Strategies , 1991, ICGA.

[21]  Thomas S. Ray,et al.  An Approach to the Synthesis of Life , 1991 .

[22]  K. Kinnear.  Fitness landscapes and difficulty in genetic programming , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[23]  Richard M. Friedberg,et al.  A Learning Machine: Part I , 1958, IBM J. Res. Dev..

[24]  David B. Fogel,et al.  An introduction to simulated evolutionary optimization , 1994, IEEE Trans. Neural Networks.