Understanding the biases of generalised recombination: part II.
This is the second part of a two-part paper where we propose, model theoretically and study a general notion of recombination for fixed-length strings where homologous recombination, inversion, gene duplication, gene deletion, diploidy and more are just special cases. In Part I, we derived both microscopic and coarse-grained evolution equations for strings and schemata for a selecto-recombinative GA using generalised recombination, and we explained the hierarchical nature of the schema evolution equations. In this part, we provide a variety of fixed points for evolution in the case where recombination is used alone, thereby generalising Geiringer's theorem. In addition, we numerically integrate the infinite-population schema equations for some interesting problems, where selection and recombination are used together to illustrate how these operators interact. Finally, to assess by how much genetic drift can make a system deviate from the infinite-population-model predictions we discuss the results of real GA runs for the same model problems with generalised recombination, selection and finite populations of different sizes.
Poli
Riccardo
R
Department Computer Science, University of Essex, Colchester, UK. rpoli@essex.ac.uk
Stephens
Christopher R
CR
D000465:Algorithms; D019143:Evolution, Molecular; D008957:Models, Genetic; D011157:Population Dynamics; D011995:Recombination, Genetic; D012641:Selection, Genetic; D013269:Stochastic Processes