Theoretical analysis of steady state genetic algorithms (Q489236)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Theoretical analysis of steady state genetic algorithms |
scientific article; zbMATH DE number 6391448
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Theoretical analysis of steady state genetic algorithms |
scientific article; zbMATH DE number 6391448 |
Statements
Theoretical analysis of steady state genetic algorithms (English)
0 references
27 January 2015
0 references
The paper analyses the convergence of the heuristic associated to a special type of genetic algorithm, namely the steady state genetic algorithm (SSGA), considered as a discrete-time dynamical system non-generational model. Inspired by the Markov chain results in finite evolutionary algorithms, conditions are given under which the SSGA heuristic converges to the population consisting of copies of the best chromosome.
0 references
genetic algorithm
0 references
Markov chain
0 references
random heuristic search
0 references
0.8135082125663757
0 references
0.8063176274299622
0 references
0.7966716289520264
0 references
0.793148398399353
0 references
0.793148398399353
0 references
