The Simple Genetic Algorithm: Foundations and Theory
The Simple Genetic Algorithm: Foundations and Theory
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
State Aggregation and Population Dynamics in Linear Systems
Artificial Life
Coarse graining selection and mutation
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Genetic Programming and Evolvable Machines
Sufficient conditions for coarse-graining evolutionary dynamics
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
Neighborhood graphs and symmetric genetic operators
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
Representation invariant genetic operators
Evolutionary Computation
Hi-index | 0.00 |
Coarse graining is defined in terms of a commutative diagram. Necessary and sufficient conditions are given in the continuously differentiable case. The theory is applied to linear coarse grainings arising from partitioning the population space of a simple Genetic Algorithm (GA). Cases considered include proportional selection, binary tournament selection, ranking selection, and mutation. A nonlinear coarse graining for ranking selection is also presented. A number of results concerning "form invariance" are given. Within the context of GAs, the primary contribution made is the illustration of a technique by which coarse grainings may be analyzed. It is applied to obtain a number of new coarse graining results.