IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v49y2020i4p769-780.html
   My bibliography  Save this article

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

Author

Listed:
  • André G. C. Pereira
  • Viviane S. M. Campos
  • André L. S. de Pinho
  • Carla A. Vivacqua
  • Roberto T. G. de Oliveira

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.

Suggested Citation

  • André G. C. Pereira & Viviane S. M. Campos & André L. S. de Pinho & Carla A. Vivacqua & Roberto T. G. de Oliveira, 2020. "On the convergence rate of the elitist genetic algorithm based on mutation probability," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 49(4), pages 769-780, February.
    • Handle: RePEc:taf:lstaxx:v:49:y:2020:i:4:p:769-780
    DOI: 10.1080/03610926.2018.1528361
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2018.1528361
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2018.1528361?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:49:y:2020:i:4:p:769-780. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.