EA models and population fixed-points versus mutation rates for functions of unitation

Authors:
J. Neal Richter;John Paxton;Alden Wright
Affiliations:
Montana State University, Bozeman, Montana;Montana State University, Bozeman, Montana;University of Montana-Missoula Missoula, Montana
Venue:
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Year:
2005

Citing 3
Cited 3

The dynamical systems model of the simple genetic algorithm

Theoretical aspects of evolutionary computing
The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
Optimal Mutation Rates in Genetic Search

Proceedings of the 5th International Conference on Genetic Algorithms

Using quotient graphs to model neutrality in evolutionary search

Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Search, neutral evolution, and mapping in evolutionary computing: a case study of grammatical evolution

IEEE Transactions on Evolutionary Computation
On the movement of vertex fixed points in the simple GA

Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation. Unitation functions are simplified fitness functions that reduce the search space into a smaller number of equivalence classes. This reduction allows easier computation of fixed points. We also create a dynamic systems model from a simple nondecreasing EA like the (1+1) EA and variants, then analyze this models on unitation classes.