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

An improved poor and rich optimization algorithm

Author

Listed:
  • Yanjiao Wang
  • Shengnan Zhou

Abstract

The poor and rich optimization algorithm (PRO) is a new bio-inspired meta-heuristic algorithm based on the behavior of the poor and the rich. PRO suffers from low convergence speed and premature convergence, and easily traps in the local optimum, when solving very complex function optimization problems. To overcome these limitations, this study proposes an improved poor and rich optimization (IPRO) algorithm. First, to meet the requirements of convergence speed and swarm diversity requirements across different evolutionary stages of the algorithm, the population is dynamically divided into the poor and rich sub-population. Second, for the rich sub-population, this study designs a novel individual updating mechanism that learns from the evolution information of the global optimum individual and that of the poor sub-population simultaneously, to further accelerate convergence speed and minimize swarm diversity loss. Third, for the poor sub-population, this study designs a novel individual updating mechanism that improves some evolution information by learning alternately from the rich and Gauss distribution, gradually improves evolutionary genes, and maintains swarm diversity. The IPRO is then compared with four state-of-the-art swarm evolutionary algorithms with various characteristics on the CEC 2013 test suite. Experimental results demonstrate the competitive advantages of IPRO in convergence precision and speed when solving function optimization problems.

Suggested Citation

  • Yanjiao Wang & Shengnan Zhou, 2023. "An improved poor and rich optimization algorithm," PLOS ONE, Public Library of Science, vol. 18(2), pages 1-36, February.
  • Handle: RePEc:plo:pone00:0267633
    DOI: 10.1371/journal.pone.0267633
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0267633
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0267633&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0267633?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:0267633. 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.