IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0273155.html
   My bibliography  Save this article

Dynamic elite strategy mayfly algorithm

Author

Listed:
  • Qianhang Du
  • Honghao Zhu

Abstract

The mayfly algorithm (MA), as a newly proposed intelligent optimization algorithm, is found that easy to fall into the local optimum and slow convergence speed. To address this, an improved mayfly algorithm based on dynamic elite strategy (DESMA) is proposed in this paper. Specifically, it first determines the specific space near the best mayfly in the current population, and dynamically sets the search radius. Then generating a certain number of elite mayflies within this range. Finally, the best one among the newly generated elite mayflies is selected to replace the best mayfly in the current population when the fitness value of elite mayfly is better than that of the best mayfly. Experimental results on 28 standard benchmark test functions from CEC2013 show that our proposed algorithm outperforms its peers in terms of accuracy speed and stability.

Suggested Citation

  • Qianhang Du & Honghao Zhu, 2022. "Dynamic elite strategy mayfly algorithm," PLOS ONE, Public Library of Science, vol. 17(8), pages 1-18, August.
    • Handle: RePEc:plo:pone00:0273155
    DOI: 10.1371/journal.pone.0273155
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0273155
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0273155&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0273155?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
    ---><---

    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:plo:pone00:0273155. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.