On the convergence rate of the elitist genetic algorithm based on mutation probability
André Grahl Pereira, Viviane Simioli Medeiros Campos, André Luís Santos de Pinho, Carla Almeida Vivacqua, Roberto Teodoro Gurgel de Oliveira · Communication in Statistics- Theory and Methods · 2019
The Markov chain approach to the elitist genetic algorithm enables not only to prove its convergence to an equilibrium distribution, but also to establish its convergence rate. These convergence rates are based on the transition matrix of the Markov chain which models the algorithm. This paper improves existing estimates of the convergence rates of the elitist genetic algorithm and presents new ones based only on the mutation probability. Experimental results illustrate that, for a fixed mutation probability, the algorithm’s mean convergence time tends to remain unchanged as the crossover probability varies. On the other hand, the reciprocal is not observed.