Theoretical analysis of steady state genetic algorithms |
| |
Authors: | Alexandru Agapie Alden H. Wright |
| |
Affiliation: | 1. Bucharest University of Economic Studies, Calea Dorobantilor 15-17, Bucharest, 010552, Romania 2. Institute of Mathematical Statistics and Applied Mathematics, Bucharest, Romania 3. Computer Science, University of Montana, Missoula, MT, 59812, USA
|
| |
Abstract: | Evolutionary Algorithms, also known as Genetic Algorithms in a former terminology, are probabilistic algorithms for optimization, which mimic operators from natural selection and genetics. 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|