Reinforcement knowledge sharing assisted two-archive evolutionary algorithm for many-objective optimization

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Qing Xu , Shuzheng Xie , Ning Yang , Ying Huang , Shaochang Nie , Wei Li
{"title":"Reinforcement knowledge sharing assisted two-archive evolutionary algorithm for many-objective optimization","authors":"Qing Xu ,&nbsp;Shuzheng Xie ,&nbsp;Ning Yang ,&nbsp;Ying Huang ,&nbsp;Shaochang Nie ,&nbsp;Wei Li","doi":"10.1016/j.swevo.2025.102139","DOIUrl":null,"url":null,"abstract":"<div><div>In many-objective optimization problems (MaOPs), algorithms are challenged in terms of convergence pressure and exploration of the complete Pareto front (PF) as the number of objectives increases. The two-archive mechanism currently offers a novel perspective to address this issue. However, most existing two-archive-based many-objective optimization algorithms focus on independently updating the convergence archive (CA) and diversity archive (DA), while paying less attention to deeper cooperation between the two archives. To facilitate deeper cooperation, this paper proposes a reinforcement knowledge sharing assisted two-archive evolutionary algorithm for many-objective optimization (RKS-TAEA). In RKS-TAEA, a generalized SDE indicator (SDEp) and a new shift-based indicator (SBI) are proposed respectively for the update of CA and DA. SDEp could well maintain the properties of the original SDE indicator on estimating population convergence, while SBI could comprehensively assess not only diversity but also convergence of candidate solutions. Both SDEp and SBI could flexibly fit MaOPs with different PF geometries once the <span><math><mi>p</mi></math></span>-value is properly set for the Minkowski distance calculated in the two indicators. Thereafter, a reinforcement knowledge-sharing mechanism is proposed to derive the <span><math><mi>p</mi></math></span>-value from the knowledge factor that is learnt by fitting the PF geometry of the MaOP generation by generation. The reinforcement knowledge-sharing mechanism achieves deeper cooperation between the two archives, which ensures that RKS-TAEA could adaptively fit complex MaOPs that have different PF geometries. Comprehensive experiments on four benchmark test suites and five real-world MaOPs demonstrate that RKS-TAEA is more competitive in comparison with some state-of-the-art many-objective evolutionary algorithms.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"98 ","pages":"Article 102139"},"PeriodicalIF":8.5000,"publicationDate":"2025-08-31","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/S2210650225002937","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 many-objective optimization problems (MaOPs), algorithms are challenged in terms of convergence pressure and exploration of the complete Pareto front (PF) as the number of objectives increases. The two-archive mechanism currently offers a novel perspective to address this issue. However, most existing two-archive-based many-objective optimization algorithms focus on independently updating the convergence archive (CA) and diversity archive (DA), while paying less attention to deeper cooperation between the two archives. To facilitate deeper cooperation, this paper proposes a reinforcement knowledge sharing assisted two-archive evolutionary algorithm for many-objective optimization (RKS-TAEA). In RKS-TAEA, a generalized SDE indicator (SDEp) and a new shift-based indicator (SBI) are proposed respectively for the update of CA and DA. SDEp could well maintain the properties of the original SDE indicator on estimating population convergence, while SBI could comprehensively assess not only diversity but also convergence of candidate solutions. Both SDEp and SBI could flexibly fit MaOPs with different PF geometries once the p-value is properly set for the Minkowski distance calculated in the two indicators. Thereafter, a reinforcement knowledge-sharing mechanism is proposed to derive the p-value from the knowledge factor that is learnt by fitting the PF geometry of the MaOP generation by generation. The reinforcement knowledge-sharing mechanism achieves deeper cooperation between the two archives, which ensures that RKS-TAEA could adaptively fit complex MaOPs that have different PF geometries. Comprehensive experiments on four benchmark test suites and five real-world MaOPs demonstrate that RKS-TAEA is more competitive in comparison with some state-of-the-art many-objective evolutionary algorithms.
强化知识共享辅助双档案进化算法的多目标优化
在多目标优化问题(MaOPs)中,随着目标数量的增加,算法在收敛压力和对完全帕累托前沿(PF)的探索方面受到挑战。双存档机制目前为解决这个问题提供了一个新的视角。然而,现有的基于双档案的多目标优化算法大多侧重于收敛档案(CA)和多样性档案(DA)的独立更新,而较少关注两个档案之间更深层次的合作。为了促进深度合作,本文提出了一种强化知识共享辅助双档案多目标优化进化算法(RKS-TAEA)。在RKS-TAEA中,分别提出了一种广义SDE指标(SDEp)和一种新的基于移位的指标(SBI)来更新CA和DA。SDEp能够很好地保持原有SDE指标在估计种群收敛性方面的特性,而SBI能够综合评价候选解的多样性和收敛性。SDEp和SBI都可以灵活地拟合具有不同PF几何形状的MaOPs,只要对两个指标中计算的Minkowski距离设置适当的p值。然后,提出了一种强化知识共享机制,通过逐代拟合MaOP的PF几何来获取知识因子的p值。强化的知识共享机制实现了两个档案馆之间更深层次的合作,保证了RKS-TAEA能够自适应适应具有不同PF几何形状的复杂MaOPs。在4个基准测试套件和5个实际MaOPs上的综合实验表明,与一些最先进的多目标进化算法相比,RKS-TAEA更具竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信