IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-981-16-8656-6_36.html
   My bibliography  Save this book chapter

Multi-objective Butterfly Optimization Algorithm for Solving Constrained Optimization Problems

In: Liss 2021

Author

Listed:
  • Mohammed M. Ahmed

    (University of Sadat City
    Scientific Research Group in Egypt (SRGE))

  • Aboul Ella Hassanien

    (Scientific Research Group in Egypt (SRGE)
    Cairo University)

  • Mincong Tang

    (Beijing Jiaotong University)

Abstract

Constraint functions are considered one of the main challenges that face Multi-objective optimization algorithm so in this paper proposes new method from multi-objective optimization algorithm that called multi-objective butterfly optimization algorithm (MOBOA) which is based on Butterfly Optimization Algorithm (BOA). The proposed algorithm MOBOA extract non-dominated solutions which store in external archive in order to maintain the diversity between the optimal set of solutions. To assess and validate the MOBOA’s effectiveness using a set of standard constrained metrics multi-objective benchmark problems that have various characteristics of Pareto front (PF). The results demonstrate that MOBOA is able to find both of better spread of solutions and convergence near the true PF. Furthermore, the quantitative and qualitative results prove that MOBOA provides high convergence and providing very competitive results in solving challenging real-world problems efficiency compared to other algorithms.

Suggested Citation

  • Mohammed M. Ahmed & Aboul Ella Hassanien & Mincong Tang, 2022. "Multi-objective Butterfly Optimization Algorithm for Solving Constrained Optimization Problems," Lecture Notes in Operations Research, in: Xianliang Shi & Gábor Bohács & Yixuan Ma & Daqing Gong & Xiaopu Shang (ed.), Liss 2021, pages 389-400, Springer.
    • Handle: RePEc:spr:lnopch:978-981-16-8656-6_36
    DOI: 10.1007/978-981-16-8656-6_36
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:lnopch:978-981-16-8656-6_36. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.