Schema Propagation in Selective Crossover

Recombination operators with high positional bias are less disruptive against adjacent genes. Therefore, it is ideal for the encoding to position epistatic genes adjacent to each other and aid GA search through genetic linkage. To produce an encoding that facilitates genetic linkage is problematic. This study focuses on selective crossover, which is an adaptive recombination operator. We propose three alternative encodings for the Royal Road problem. We use these encodings to analyse the performance of selective crossover with respect to different encodings. This study shows that the performance of selective crossover is consistent and is not affected by alternative encodings of a problem, unlike two-point crossover. The encodings are also used to understand the behaviour of selective crossover in terms of schema propagation. Experimental results indicate that selective crossover provides a better balance between exploration and exploitation than conventional recombination operators.

[1]  Annie S. Wu,et al.  Empirical Observations on the Roles of Crossover and Mutation , 1997, ICGA.

[2]  James E. Baker,et al.  Reducing Bias and Inefficienry in the Selection Algorithm , 1987, ICGA.

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

[4]  Kanta Premji Vekaria,et al.  Selective Crossover in Genetic Algorithms: An Empirical Study , 1998, PPSN.

[5]  K Vekaria,et al.  Biases introduced by adaptive recombination operators , 1999 .

[6]  G. Harik Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms , 1997 .

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

[8]  William M. Spears,et al.  The role of mutation and recombination in evolutionary algorithms , 1998 .

[9]  Georges R. Harik,et al.  Foundations of Genetic Algorithms , 1997 .

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

[11]  Hillol Kargupta,et al.  The Gene Expression Messy Genetic Algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[12]  Jeffrey Horn,et al.  Handbook of evolutionary computation , 1997 .

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

[14]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

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

[16]  William M. Spears,et al.  Crossover or Mutation? , 1992, FOGA.

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