Balancing Parent and Offspring Selection in Genetic Programming

In order to drive Genetic Programming (GP) search towards an optimal situation, balancing selection pressure between the parent and offspring selection phases is an important aspect and very challenging. Our previous work showed that stochastic elements cannot be removed from both parent and offspring selections and suggested that maximising diversity in parents and minimising randomness in offspring could provide significantly good performance. This paper conducts additional carefully designed experiments to further investigate how diverse the parent should be if the offspring selection pressure is intensive. This paper shows that any attempt on adding more selection pressure to the parent selection can result in lower GP performance, and the higher the parent selection pressure, the worse the GP performance. The results confirm and strengthen the finding in our previous work.

[1]  Lothar Thiele,et al.  A Mathematical Analysis of Tournament Selection , 1995, ICGA.

[2]  Dr. Zbigniew Michalewicz,et al.  How to Solve It: Modern Heuristics , 2004 .

[3]  Will N. Browne,et al.  An autonomous explore/exploit strategy , 2005, GECCO '05.

[4]  Riccardo Poli,et al.  Backward-chaining evolutionary algorithms , 2006, Artif. Intell..

[5]  Mark Johnston,et al.  Is the not-sampled issue in tournament selection critical? , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[6]  Leon G. Higley,et al.  Forensic Entomology: An Introduction , 2009 .

[7]  Malcolm I. Heywood,et al.  On Naïve Crossover Biases with Reproduction for Simple Solutions to Classification Problems , 2004, GECCO.

[8]  Marco Tomassini,et al.  Soft computing - integrating evolutionary, neural, and fuzzy systems , 2001 .

[9]  Steven M. Gustafson.  An analysis of diversity in genetic programming , 2004 .

[10]  Larry J. Eshelman,et al.  Crossover's Niche , 1993, ICGA.

[11]  Larry J. Eshelman,et al.  Biases in the Crossover Landscape , 1989, ICGA.

[12]  Bart Naudts,et al.  A motivated definition of exploitation and exploration , 1999 .

[13]  J. David Schaffer,et al.  Proceedings of the third international conference on Genetic algorithms , 1989 .

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

[15]  J. Kratica,et al.  Fine Grained Tournament Selection for the Simple Plant Location Problem , 2002 .

[16]  Ian C. Parmee,et al.  An Investigation of Exploration and Exploitation Within Cluster Oriented Genetic Algorithms (COGAs) , 1999, GECCO.

[17]  Mengjie Zhang,et al.  An analysis of constructive crossover and selection pressure in genetic programming , 2007, GECCO '07.

[18]  L. Darrell Whitley,et al.  Unbiased tournament selection , 2005, GECCO '05.

[19]  D. H. Robinson,et al.  Simulating exponential normalization with weighted k-tournaments , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

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

[21]  Andrew McCallum,et al.  Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data , 2004, J. Mach. Learn. Res..

[22]  Kenneth A. De Jong,et al.  A formal analysis of the role of multi-point crossover in genetic algorithms , 1992, Annals of Mathematics and Artificial Intelligence.

[23]  David W. Corne,et al.  A Real Coded Genetic Algorithm with an Explorer and an Exploiter Populations , 1997, ICGA.

[24]  Richard Mark Downing,et al.  Neutrality and gradualism: encouraging exploration and exploitation simultaneously with Binary Decision Diagrams , 2006, 2006 IEEE International Conference on Evolutionary Computation.

[25]  Dirk P. Kroese,et al.  Simulation and the Monte Carlo method , 1981, Wiley series in probability and mathematical statistics.

[26]  A. E. Eiben,et al.  On Evolutionary Exploration and Exploitation , 1998, Fundam. Informaticae.

[27]  Riccardo Poli,et al.  Genetic and Evolutionary Computation – GECCO 2004 , 2004, Lecture Notes in Computer Science.

[28]  Samir W. Mahfoud.  Crowding and Preselection Revisited , 1992, PPSN.

[29]  Reinhold Huber-Mörk,et al.  Mixed size tournament selection , 2002, Soft Comput..

[30]  Conor Ryan,et al.  A Less Destructive, Context-Aware Crossover Operator for GP , 2006, EuroGP.

[31]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[32]  Dirk P. Kroese,et al.  Simulation and the Monte Carlo Method (Wiley Series in Probability and Statistics) , 1981 .