On the stationary distribution of GAs with fixed crossover probability

Authors:
U. Chandimal de Silva;Joe Suzuki
Affiliations:
Osaka University, Toyonaka, Osaka, Japan;Osaka University, Toyonaka, Osaka, Japan
Venue:
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Year:
2005

Citing 6
Cited 2

Toward an extrapolation of the simulated annealing convergence theory onto the simple genetic algorithm144438

Toward an extrapolation of the simulated annealing convergence theory onto the simple genetic algorithm144438
Theory of genetic algorithms

Theoretical Computer Science
The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
Foundations of Genetic Algorithms

Foundations of Genetic Algorithms
An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.
A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Estimating the ratios of the stationary distribution values for markov chains modeling evolutionary algorithms

Evolutionary Computation
The effect of varying the crossover rate in the evolution of bidding strategies

ACST '08 Proceedings of the Fourth IASTED International Conference on Advances in Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyse the convergence of a GA when the mutation probability is low and the selection pressure is high, for arbitrary crossover types and probabilities. We succeed in mathematically proving that the stationary distribution associated with the Markov chain concentrates on uniform populations of the best individuals, as would be expected.