Monitoring Genetic Variations in Variable Length Evolutionary Algorithms

Initially, Artificial Evolution focuses on Evolutionary Algorithms handling solutions coded in fixed length structures. In this context, the role of crossover is clearly the mixing of information between solutions. The development of Evolutionary Algorithms operating on structures with variable length, of which genetic programming is one of the most representative instances, opens new questions on the effects of crossover. Beside mixing, two new effects are identified : the diffusion of information inside solutions and the variation of the solutions sizes. In this paper, we propose a experimental framework to study these three effects and apply it on three different crossovers for genetic programming : the Standard Crossover, the One-Point Crossover and the Maximum Homologous Crossover. Exceedingly different behaviors are reported leading us to consider the necessary future decoupling of the mixing, the diffusion and the size variation.

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

[2]  Philippe Collard,et al.  Size Control with Maximum Homologous Crossover , 2005, Artificial Evolution.

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

[4]  Alden H. Wright,et al.  Allele Diffusion in Linear Genetic Programming and Variable-Length Genetic Algorithms with Subtree Crossover , 2002, EuroGP.

[5]  Philippe Collard,et al.  Size control with maximum homologous crossover , 2006 .

[6]  Kalyanmoy Deb,et al.  Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..

[7]  W. Langdon,et al.  Genetic Programming with One-Point Crossover , 1998 .

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

[9]  Peter Nordin,et al.  Homologous Crossover in Genetic Programming , 1999, GECCO.

[10]  Philippe Collard,et al.  Maximum Homologous Crossover for Linear Genetic Programming , 2003, EuroGP.

[11]  Riccardo Poli,et al.  Exact Schema Theorems for GP with One-Point and Standard Crossover Operating on Linear Structures and Their Application to the Study of the Evolution of Size , 2001, EuroGP.

[12]  Riccardo Poli,et al.  Foundations of Genetic Programming , 1999, Springer Berlin Heidelberg.

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

[14]  Jason M. Daida,et al.  Probing for limits to building block mixing with a tunably-difficult problem for genetic programming , 2005, GECCO '05.

[15]  Dirk Thierens Dimensional Analysis of Allele-Wise Mixing Revisited , 1996, PPSN.