Cartesian Genetic Programming in a changing environment

Evolutionary algorithm are prevalently being used in static environments. In a dynamically changing environment an evolutionary algorithm must be also able to cope with the changes of the environment. This paper describes an algorithm based on Cartesian Genetic Programming (CGP) that is used to design and optimise a solution in a simulated symbolic regression problem in a changing environment. A modified version of the Age-Layered Population Structure (ALPS) algorithm is being used in cooperation with CGP. It is shown that the usage of ALPS can improve the performance on of CGP when solving problems in a changing environment.

[1]  Simon Harding,et al.  Evolution of image filters on graphics processor units using Cartesian Genetic Programming , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[2]  Zdenek Vasícek,et al.  Efficient Phenotype Evaluation in Cartesian Genetic Programming , 2012, EuroGP.

[3]  Gregory Hornby,et al.  ALPS: the age-layered population structure for reducing the problem of premature convergence , 2006, GECCO.

[4]  M. Collins.  Finding needles in haystacks is harder with neutrality , 2006, Genetic Programming and Evolvable Machines.

[5]  Lukás Sekanina,et al.  Evaluation of a New Platform For Image Filter Evolution , 2007, Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007).

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

[7]  J. Miller.  An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach , 1999 .

[8]  M. Collins.  Finding needles in haystacks is harder with neutrality , 2005, GECCO '05.

[9]  Karel Slaný,et al.  Comparison of CGP and Age-Layered CGP Performance in Image Operator Evolution , 2009, EuroGP.

[10]  Stephen L. Smith,et al.  Redundancy and Computational Efficiency in , 2006 .

[11]  Julian Francis Miller,et al.  Investigating the performance of module acquisition in cartesian genetic programming , 2005, GECCO '05.

[12]  Julian Francis Miller,et al.  Cartesian genetic programming , 2000, GECCO '10.

[13]  Julian Francis Miller,et al.  Redundancy and computational efficiency in Cartesian genetic programming , 2006, IEEE Transactions on Evolutionary Computation.

[14]  Marc Ebner,et al.  How neutral networks influence evolvability , 2001, Complex..

[15]  Julian Francis Miller,et al.  Neutrality and the Evolvability of Boolean Function Landscape , 2001, EuroGP.