International Journal of Pattern Recognition and Artificial Intelligence · 1996 · 221 citations · 0 references
ArchitectureGeneticsAlgorithmsEvolutionary TheoryOptimizationEvolutionary ComputationEvolutionary OptimizationGenetic AlgorithmsMarkov ChainsMutation OperatorsPopulation-based SearchEvolutionary AlgorithmsEvolutionary SearchFinite Markov ChainsFinite-state Markov ChainsGenetic Algorithm OptimizationGenetic Algorithms For SearchMutationPopulation-based Optimization
In this article, the genetic algorithm with elitist model (EGA) is modeled as a finite state Markov chain. A state in the Markov chain denotes a population together with a potential string. Proof for the convergence of an EGA to the best chromosome (string), among all possible chromosomes, is provided here. Mutation operation has been found to be essential for convergence. It has been shown that an EGA converges to the global optimal solution with any choice of initial population.