Multimodal multiobjective differential evolution algorithm based on enhanced decision space search

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Jing Liang , Xudong Sui , Caitong Yue , Mingyuan Yu , Guang Li , Mengmeng Li
{"title":"Multimodal multiobjective differential evolution algorithm based on enhanced decision space search","authors":"Jing Liang ,&nbsp;Xudong Sui ,&nbsp;Caitong Yue ,&nbsp;Mingyuan Yu ,&nbsp;Guang Li ,&nbsp;Mengmeng Li","doi":"10.1016/j.swevo.2024.101682","DOIUrl":null,"url":null,"abstract":"<div><p>Multimodal multiobjective optimization problems (MMOPs) have attracted extensive research interest. These problems are characterized by the presence of multiple equivalent optimal solutions in the decision space, all corresponding to the same optimal values in the objective space. However, effectively finding a high-quality and evenly distributed Pareto sets (PSs) remains a challenge for researchers. This paper introduces a multimodal multiobjective differential evolution algorithm based on enhanced decision space search (MMODE_EDSS). By adopting two types of strategies to enhance the decision space search capability, the algorithm generates multiple high-quality non-dominated solutions. In the early stages of evolution, neighborhood information is used to enhance search capabilities, while in the later stages, data interpolation methods following clustering are employed for searching. Moreover, to improve the overall population distribution, an environmental selection mechanism based on dual-space crowding distance is adopted. The effectiveness of the proposed algorithm, MMODE_EDSS, is evaluated by comparing it with eight state-of-the-art multimodal multiobjective evolutionary algorithms (MMOEAs). Experimental results confirm the significant advantages of MMODE_EDSS.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"90 ","pages":"Article 101682"},"PeriodicalIF":8.2000,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650224002207","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Multimodal multiobjective optimization problems (MMOPs) have attracted extensive research interest. These problems are characterized by the presence of multiple equivalent optimal solutions in the decision space, all corresponding to the same optimal values in the objective space. However, effectively finding a high-quality and evenly distributed Pareto sets (PSs) remains a challenge for researchers. This paper introduces a multimodal multiobjective differential evolution algorithm based on enhanced decision space search (MMODE_EDSS). By adopting two types of strategies to enhance the decision space search capability, the algorithm generates multiple high-quality non-dominated solutions. In the early stages of evolution, neighborhood information is used to enhance search capabilities, while in the later stages, data interpolation methods following clustering are employed for searching. Moreover, to improve the overall population distribution, an environmental selection mechanism based on dual-space crowding distance is adopted. The effectiveness of the proposed algorithm, MMODE_EDSS, is evaluated by comparing it with eight state-of-the-art multimodal multiobjective evolutionary algorithms (MMOEAs). Experimental results confirm the significant advantages of MMODE_EDSS.

基于增强型决策空间搜索的多模式多目标差分进化算法
多模式多目标优化问题(MMOPs)引起了广泛的研究兴趣。这些问题的特点是在决策空间中存在多个等效最优解,所有这些最优解都与目标空间中的相同最优值相对应。然而,如何有效地找到高质量且均匀分布的帕雷托集(PSs)仍然是研究人员面临的一项挑战。本文介绍了一种基于增强决策空间搜索的多模态多目标差分进化算法(MMODE_EDSS)。通过采用两种策略来增强决策空间搜索能力,该算法可以生成多个高质量的非支配解。在进化的早期阶段,利用邻域信息增强搜索能力,而在后期阶段,则采用聚类后的数据插值方法进行搜索。此外,为了改善总体种群分布,还采用了基于双空间拥挤距离的环境选择机制。通过与八种最先进的多模式多目标进化算法(MMOEAs)进行比较,评估了所提出的算法 MMODE_EDSS 的有效性。实验结果证实了 MMODE_EDSS 的显著优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信