Convergence rates for a class of evolutionary algorithms with elitist strategy (Q5957122)
From MaRDI portal
scientific article; zbMATH DE number 1714227
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence rates for a class of evolutionary algorithms with elitist strategy |
scientific article; zbMATH DE number 1714227 |
Statements
Convergence rates for a class of evolutionary algorithms with elitist strategy (English)
0 references
8 July 2002
0 references
Evolutionary (genetic) algorithms for solving global optimisation problems can be modelled as Markov chains. The authors discuss the convergence rates for a class of evolutionary algorithms in general search spaces by means of the ergodic theory of Markov chains and some techniques of Banach algebra. Conditions that guarantee the exponential rates are mentioned.
0 references
evolutionary algorithms
0 references
genetic algorithm
0 references
global optimisation
0 references
convergence
0 references
Markov chains
0 references
