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

An Evolutionary Algorithm with Clustering-Based Assisted Selection Strategy for Multimodal Multiobjective Optimization

Author

Listed:
  • Naili Luo
  • Wu Lin
  • Peizhi Huang
  • Jianyong Chen
  • Guang Li

Abstract

In multimodal multiobjective optimization problems (MMOPs), multiple Pareto optimal sets, even some good local Pareto optimal sets, should be reserved, which can provide more choices for decision-makers. To solve MMOPs, this paper proposes an evolutionary algorithm with clustering-based assisted selection strategy for multimodal multiobjective optimization, in which the addition operator and deletion operator are proposed to comprehensively consider the diversity in both decision and objective spaces. Specifically, in decision space, the union population is partitioned into multiple clusters by using a density-based clustering method, aiming to assist the addition operator to strengthen the population diversity. Then, a number of weight vectors are adopted to divide population into N subregions in objective space (N is population size). Moreover, in the deletion operator, the solutions in the most crowded subregion are first collected into previous clusters, and then the worst solution in the most crowded cluster is deleted until there are N solutions left. Our algorithm is compared with other multimodal multiobjective evolutionary algorithms on the well-known benchmark MMOPs. Numerical experiments report the effectiveness and advantages of our proposed algorithm.

Suggested Citation

  • Naili Luo & Wu Lin & Peizhi Huang & Jianyong Chen & Guang Li, 2021. "An Evolutionary Algorithm with Clustering-Based Assisted Selection Strategy for Multimodal Multiobjective Optimization," Complexity, Hindawi, vol. 2021, pages 1-13, January.
  • Handle: RePEc:hin:complx:4393818
    DOI: 10.1155/2021/4393818
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/4393818.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/4393818.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/4393818?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:complx:4393818. 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.