On the convergence rate of the elitist genetic algorithm based on mutation probability

André G. C. Pereira, Viviane S. M. Campos, André L. S. de Pinho, Carla A. Vivacqua and Roberto T. G. de Oliveira

Communications in Statistics - Theory and Methods, 2020, vol. 49, issue 4, 769-780

Abstract: 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.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/03610926.2018.1528361 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:lstaxx:v:49:y:2020:i:4:p:769-780

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/lsta20

DOI: 10.1080/03610926.2018.1528361

Access Statistics for this article

Communications in Statistics - Theory and Methods is currently edited by Debbie Iscoe

More articles in Communications in Statistics - Theory and Methods from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().