IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0331713.html

Multi-objective dung beetle optimization algorithm: A novel algorithm for solving complex multi-objective optimization problems

Author

Listed:
  • Wenxing Wu
  • Liqin Tian
  • Junyi Wu
  • Lianhai Lin

Abstract

Many increasingly complex multi-objective optimization problems are emerging, and there is an urgent need to develop new multi-objective optimization algorithms to meet the challenges. This study introduces the Multi-Objective Dung Beetle Optimization Algorithm (MODBO), which integrates competitive and neighborhood mechanisms to tackle such problems, Thanks to the dung beetle optimization algorithm’s fast convergence and robust optimization finding ability in single-objective optimization algorithms. The introduction of non-dominated sorting allows the Dung Beetle Optimization Algorithm to solve multi-objective optimization problems (MOPs). To make the Dung Beetle Optimization Algorithm maintain good search ability in searching, we introduce a Competition mechanism to guide the particles’ global optimal search and a Neighborhood mechanism to guide the particles’ local optimal value search. An external archive is introduced to make each generation positionally optimal. Finally, to analyze whether the MODBO algorithm’s improved strategy is effective, a comparison with the nine algorithms on CEC2020 was made, and the 3D sensor deployment problem was used to demonstrate that the MODBO algorithm can solve realistic problems.

Suggested Citation

  • Wenxing Wu & Liqin Tian & Junyi Wu & Lianhai Lin, 2025. "Multi-objective dung beetle optimization algorithm: A novel algorithm for solving complex multi-objective optimization problems," PLOS ONE, Public Library of Science, vol. 20(10), pages 1-27, October.
    • Handle: RePEc:plo:pone00:0331713
    DOI: 10.1371/journal.pone.0331713
    as

    Download full text from publisher

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