IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/8948729.html
   My bibliography  Save this article

A Decomposition-Based Harmony Search Algorithm for Multimodal Multiobjective Optimization

Author

Listed:
  • Wei Xu
  • Weifeng Gao
  • Qianlong Dang
  • Xueyi Wang

Abstract

Multimodal multiobjective optimization problem (MMOP) is a special kind of multiobjective optimization problem (MOP) with multimodal characteristics, where multiple different Pareto optimal sets (PSs) map to the same Pareto optimal front (PF). To handle MMOPs, a decomposition-based harmony search algorithm (called MOEA/D-HSA) is devised. In MOEA/D-HSA, multiple individuals who are assigned to the same weight vector form a subpopulation for finding multiple different PSs. Then, an environmental selection method based on greedy selection is designed to dynamically adjust the subpopulation scale for keeping the population diversity. Finally, the modified harmony search algorithm and elite learning strategy are utilized to balance the diversity and convergence of the population. Experimental results on the CEC 2019 test suite reveal that MOEA/D-HSA has superior performance than a few state-of-the-art algorithms.

Suggested Citation

  • Wei Xu & Weifeng Gao & Qianlong Dang & Xueyi Wang, 2022. "A Decomposition-Based Harmony Search Algorithm for Multimodal Multiobjective Optimization," Discrete Dynamics in Nature and Society, Hindawi, vol. 2022, pages 1-12, May.
    • Handle: RePEc:hin:jnddns:8948729
    DOI: 10.1155/2022/8948729
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/ddns/2022/8948729.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/ddns/2022/8948729.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/8948729?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:hin:jnddns:8948729. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.