Block optimization and switchable hybrid clustering for multimodal multiobjective evolutionary optimization with shifted local Pareto front

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Yu Zhang, Wang Hu
{"title":"Block optimization and switchable hybrid clustering for multimodal multiobjective evolutionary optimization with shifted local Pareto front","authors":"Yu Zhang,&nbsp;Wang Hu","doi":"10.1016/j.swevo.2025.102151","DOIUrl":null,"url":null,"abstract":"<div><div>Existing multimodal multiobjective evolutionary algorithms (MMOEAs) often struggle with translated test functions and fail to effectively identify and maintain local Pareto fronts (PFs) due to the lack of niche-based strategies. To overcome these limitations, a novel two-stage MMOEA termed MMOEA-BH is proposed with block optimization and switchable hybrid clustering. Key innovations include a block optimization strategy utilizing adaptive region stretching and regression-based dimensional analysis, and a switchable hybrid clustering method combining affinity propagation, k-means, and density-based spatial clustering of applications with noise (DBSCAN). These innovations enable MMOEA-BH to effectively address translated test functions and maintain both global and local niches in decision and objective spaces. To address the lack of robust evaluation methods for MMOEAs when solving translated MMOPs, a new set of shifted multimodal multiobjective functions (SMMF) is introduced by translating the existing MMOPs. Experimental results, including comparisons with state-of-the-art algorithms, ablation studies on block optimization, and sensitivity analyses on key parameters, demonstrate that MMOEA-BH outperforms existing algorithms on these SMMF functions. This highlights the efficacy of the proposed block optimization and switchable hybrid clustering strategies in solving MMOPs with translation characteristics.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"98 ","pages":"Article 102151"},"PeriodicalIF":8.5000,"publicationDate":"2025-09-01","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/S2210650225003086","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

Existing multimodal multiobjective evolutionary algorithms (MMOEAs) often struggle with translated test functions and fail to effectively identify and maintain local Pareto fronts (PFs) due to the lack of niche-based strategies. To overcome these limitations, a novel two-stage MMOEA termed MMOEA-BH is proposed with block optimization and switchable hybrid clustering. Key innovations include a block optimization strategy utilizing adaptive region stretching and regression-based dimensional analysis, and a switchable hybrid clustering method combining affinity propagation, k-means, and density-based spatial clustering of applications with noise (DBSCAN). These innovations enable MMOEA-BH to effectively address translated test functions and maintain both global and local niches in decision and objective spaces. To address the lack of robust evaluation methods for MMOEAs when solving translated MMOPs, a new set of shifted multimodal multiobjective functions (SMMF) is introduced by translating the existing MMOPs. Experimental results, including comparisons with state-of-the-art algorithms, ablation studies on block optimization, and sensitivity analyses on key parameters, demonstrate that MMOEA-BH outperforms existing algorithms on these SMMF functions. This highlights the efficacy of the proposed block optimization and switchable hybrid clustering strategies in solving MMOPs with translation characteristics.
局部Pareto前沿移位的多模态多目标进化优化的块优化和可切换混合聚类
现有的多模态多目标进化算法(mmoea)由于缺乏基于小生境的策略,常常难以有效地识别和维护局部帕累托前沿(PFs)。为了克服这些限制,提出了一种基于块优化和可切换混合聚类的新型两阶段MMOEA- bh。关键创新包括利用自适应区域扩展和基于回归的维度分析的块优化策略,以及结合亲和传播、k-means和基于密度的噪声应用空间聚类(DBSCAN)的可切换混合聚类方法。这些创新使MMOEA-BH能够有效地解决翻译测试功能,并在决策和目标空间中保持全球和本地利基。为了解决平移多模态多目标函数在求解平移多模态多目标函数时缺乏鲁棒性评估方法的问题,通过平移现有多模态多目标函数,引入了一组新的移位多模态多目标函数(SMMF)。实验结果,包括与最先进算法的比较,块优化的消融研究以及关键参数的敏感性分析,表明MMOEA-BH在这些SMMF函数上优于现有算法。这突出了所提出的块优化和可切换混合聚类策略在求解具有平移特征的MMOPs方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信