Coarse-graining in genetic algorithms: some issues and examples

Authors:
Andrés Aguilar Contreras;Jonathan E. Rowe;Christopher R. Stephens
Affiliations:
Instituto de Investigación en Matemáticas Aplicadas y Sistemas, UNAM, México D.F.;School of Computer Science, University of Birmingham, Birmingham, Great Britain;Instituto de Ciencias Nucleares, UNAM, México D.F.
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Year:
2003

Citing 5
Cited 3

Generalizing the notion of schema in genetic algorithms

Artificial Intelligence
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
Exact Results From A Coarse Grained Formulation Of The Dynamics Of Variable-length Genetic Algorithms

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Form Invariance and Implicit Parallelism

Evolutionary Computation

A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations

Proceedings of the 8th annual conference on Genetic and evolutionary computation
EC theory: a unified viewpoint

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Sufficient conditions for coarse-graining evolutionary dynamics

FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 SelectionWeighted Linkage Disequilibrium Coefficient for the two-bit onemax problem.