A Study in Set Recombination

A family of problems for which the solution is a fixed size set is studied, using fitness functions with varying degrees of epistasis. An empirical comparison between a traditional crossover operator with a binary representation and a penalty function, and the representationindependent Random Assorting Recombination Operator (RAR) is performed. RAR is found to perform marginally better in all cases. Since RAR is a parameterised operator, a study of the effect of varying its parameter, which can control any trade-off between respect and assortment, is also presented.

[1]  Zbigniew Michalewicz,et al.  Handling Constraints in Genetic Algorithms , 1991, ICGA.

[2]  David E. Goldberg,et al.  Real-coded Genetic Algorithms, Virtual Alphabets, and Blocking , 1991, Complex Syst..

[3]  Tariq Samad,et al.  Towards the Genetic Synthesisof Neural Networks , 1989, ICGA.

[4]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[5]  Kenneth A. De Jong,et al.  On the Virtues of Parameterised Uniform Crossover , 1991, ICGA.

[6]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis , 1989, Complex Syst..

[7]  Gunar E. Liepins,et al.  Schema Disruption , 1991, ICGA.

[8]  Larry J. Eshelman,et al.  Foundations of Genetic Algorithms-2 , 1993 .

[9]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[10]  Nicholas J. Radcliffe,et al.  Equivalence Class Analysis of Genetic Algorithms , 1991, Complex Syst..

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

[12]  Lashon B. Booker,et al.  Proceedings of the fourth international conference on Genetic algorithms , 1991 .

[13]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[14]  Nicholas J. Radcliffe,et al.  Genetic neural networks on MIMD computers , 1992 .

[15]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction , 1989, Complex Syst..

[16]  David E. Goldberg,et al.  Alleles, loci and the traveling salesman problem , 1985 .

[17]  Alden H. Wright,et al.  Genetic Algorithms for Real Parameter Optimization , 1990, FOGA.

[18]  Michael D. Vose,et al.  Generalizing the Notion of Schema in Genetic Algorithms , 1991, Artif. Intell..

[19]  Nicholas J. Radcliffe,et al.  Genetic Set Recombination , 1992, FOGA.

[20]  Jim Antonisse,et al.  A New Interpretation of Schema Notation that Overtums the Binary Encoding Constraint , 1989, ICGA.

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

[22]  Gunar E. Liepins,et al.  Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.

[23]  Gilbert Syswerda,et al.  Uniform Crossover in Genetic Algorithms , 1989, ICGA.