Coarse-graining in genetic algorithms: Some issues and examples
Por:
Contreras A.A., Rowe J.E., Stephens C.R.
Publicada:
1 ene 2003
Resumen:
Following the work of Stephens and coworkers on the coarse-grained dynamics of genetic systems, we work towards a possible generalisation in the context of genetic algorithms, giving as examples schemata, genotype-phenotype mappings, and error classes in the Eigen model. We discuss how the dynamics transforms under a coarse-graining, comparing and contrasting different notions of invariance. We work out some examples in the two-bit case, to illustrate the ideas and issues. We then find a bound for the Selection Weighted Linkage Disequilibrium Coefficient for the two-bit onemax problem. © Springer-Verlag Berlin Heidelberg 2003.
Filiaciones:
Contreras A.A.:
Instituto de Investigación en Matemáticas Aplicadas y Sistemas, UNAM, Ciudad Universitaria, Circuito Escolar, México D.F. 04510, Mexico
Rowe J.E.:
School of Computer Science, University of Birmingham, Birmingham B15 2TT, United Kingdom
Stephens C.R.:
Instituto de Ciencias Nucleares, UNAM, Circuito Exterior, A. Postal 70-543, México D.F. 04510, Mexico
|