Multimodal multi-objective optimization via multi-operator adaptation and clustering-based environmental selection

IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xinyi Wu , Fei Ming , Wenyin Gong , Bolin Liao , Yuanyuan Guo
{"title":"Multimodal multi-objective optimization via multi-operator adaptation and clustering-based environmental selection","authors":"Xinyi Wu ,&nbsp;Fei Ming ,&nbsp;Wenyin Gong ,&nbsp;Bolin Liao ,&nbsp;Yuanyuan Guo","doi":"10.1016/j.swevo.2025.101962","DOIUrl":null,"url":null,"abstract":"<div><div>In real world applications, multimodal multi-objective optimization problems are common, addressing which can offer decision makers multiple choices to accommodate varying scenarios. Many researchers have been focusing on this kind of problem, leading to the development of numerous multimodal multi-objective evolutionary optimization algorithms (MMOEAs). However, most existing MMOEAs employ a fixed operator to generate offspring. For different types of problems, the use of hybrid operators can take advantage of their distinct features in reproduction to produce more valuable individuals. To address this issue, we propose an innovative algorithm that integrates two operators collaboratively and dynamically adjusts the proportion of offspring generated by each operator based on its performance throughout the evolution process evaluated by the survival rate. In addition, to better balance the diversity, the proposed algorithm devises a novel clustering method, which clusters the population in the decision space. Then, individuals within the same cluster with better performance in the objective space are able to survive. We evaluate our algorithm against seven representative MMOEAs on two widely used benchmark problems and real-world problems. The experimental results confirm the superior performance and robustness of our approach on both benchmark and real-world problems.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"96 ","pages":"Article 101962"},"PeriodicalIF":8.2000,"publicationDate":"2025-05-06","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/S2210650225001208","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

In real world applications, multimodal multi-objective optimization problems are common, addressing which can offer decision makers multiple choices to accommodate varying scenarios. Many researchers have been focusing on this kind of problem, leading to the development of numerous multimodal multi-objective evolutionary optimization algorithms (MMOEAs). However, most existing MMOEAs employ a fixed operator to generate offspring. For different types of problems, the use of hybrid operators can take advantage of their distinct features in reproduction to produce more valuable individuals. To address this issue, we propose an innovative algorithm that integrates two operators collaboratively and dynamically adjusts the proportion of offspring generated by each operator based on its performance throughout the evolution process evaluated by the survival rate. In addition, to better balance the diversity, the proposed algorithm devises a novel clustering method, which clusters the population in the decision space. Then, individuals within the same cluster with better performance in the objective space are able to survive. We evaluate our algorithm against seven representative MMOEAs on two widely used benchmark problems and real-world problems. The experimental results confirm the superior performance and robustness of our approach on both benchmark and real-world problems.
基于多算子自适应和聚类环境选择的多模态多目标优化
在现实世界的应用中,多模态多目标优化问题很常见,解决这些问题可以为决策者提供多种选择,以适应不同的场景。许多研究人员一直关注这类问题,并由此开发了许多多模态多目标进化优化算法(mmoea)。然而,大多数现有的mmoea都使用固定的操作员来产生后代。对于不同类型的问题,使用混合算子可以利用它们在繁殖中的独特特征来产生更有价值的个体。为了解决这一问题,我们提出了一种创新的算法,该算法将两个算子协同集成,并根据其在整个进化过程中的表现动态调整每个算子产生的后代比例。此外,为了更好地平衡多样性,该算法设计了一种新的聚类方法,将决策空间中的种群聚类。然后,同一聚类中在目标空间中表现较好的个体能够生存下来。我们针对两个广泛使用的基准问题和现实世界问题的七个代表性mmoea评估了我们的算法。实验结果证实了我们的方法在基准测试和现实问题上的优越性能和鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信