Theoretical analysis of steady state genetic algorithms (Q489236)

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.