A Distance Between Populations for n-Points Crossover in Genetic Algorithms

Abstract The theoretical study of Genetic Algorithms and the dynamics induced by their genetic operators is a research field with a long history and many different approaches. In this paper we complete a recently presented approach to model one-point crossover using pretopologies (or Cechtopologies) in two ways. First, we extend it to the case of n-points crossover. We extend the definition of crossover distance between populations to work for n-points crossover, proving that computing it can be performed in polynomial time for any fixed number of crossover points. Secondly, we experimentally study how the distance distribution changes when the number of crossover points increases. In particular, the average distance between a population and the optimum decreases with the increase in the number of crossover points, showing that increasing the latter can reduce the number of crossover operations needed to evolve an optimal solution.

[1]  Peter F. Stadler,et al.  Recombination Spaces, Metrics, and Pretopologies , 2002 .

[2]  Leonardo Vanneschi,et al.  A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming , 2005, Evolutionary Computation.

[3]  Riccardo Poli,et al.  Topological Interpretation of Crossover , 2004, GECCO.

[4]  Leonardo Vanneschi,et al.  Theory and practice for efficient genetic programming , 2004 .

[5]  Michael D. Vose,et al.  The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.

[6]  Yong-Hyuk Kim,et al.  New topologies for genetic search space , 2005, GECCO '05.

[7]  Victor J. Rayward-Smith,et al.  Fitness Distance Correlation and Ridge Functions , 1998, PPSN.

[8]  Michael D. Vose.  Course notes: genetic algorithm theory , 2010, GECCO '10.

[9]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[10]  Alberto Moraglio,et al.  Geometry of evolutionary algorithms , 2011, GECCO.

[11]  Alberto Moraglio,et al.  Quotient geometric crossovers and redundant encodings , 2012, Theor. Comput. Sci..

[12]  Alberto Moraglio,et al.  One-Point Geometric Crossover , 2010, PPSN.

[13]  Peter F. Stadler,et al.  Algebraic Theory of Recombination Spaces , 1997, Evolutionary Computation.

[14]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.

[15]  Giancarlo Mauri,et al.  A distance between populations for one-point crossover in genetic algorithms , 2012, Theor. Comput. Sci..

[16]  Melanie Mitchell,et al.  The royal road for genetic algorithms: Fitness landscapes and GA performance , 1991 .

[17]  Colin R. Reeves,et al.  Genetic Algorithms: Principles and Perspectives: A Guide to Ga Theory , 2002 .

[18]  Leonardo Vanneschi,et al.  How Far Is It from Here to There? A Distance That Is Coherent with GP Operators , 2011, EuroGP.