Applications of Mathematics
Springer Berlin Heidelberg
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.
genetic algorithm, Markov chain, random heuristic search MSC 2010: 60J10, 68W20, 90C59
© Springer International Publishing AG, Part of Springer Science+Business Media
Agapie, Alexandru and Wright, Alden H., "Theoretical Analysis of Steady State Genetic Algorithms" (2014). Computer Science Faculty Publications. 28.