Qing Xu , Shuzheng Xie , Ning Yang , Ying Huang , Shaochang Nie , Wei Li
{"title":"强化知识共享辅助双档案进化算法的多目标优化","authors":"Qing Xu , Shuzheng Xie , Ning Yang , Ying Huang , Shaochang Nie , 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":"{\"title\":\"Reinforcement knowledge sharing assisted two-archive evolutionary algorithm for many-objective optimization\",\"authors\":\"Qing Xu , Shuzheng Xie , Ning Yang , Ying Huang , Shaochang Nie , 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}","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}
Reinforcement knowledge sharing assisted two-archive evolutionary algorithm for many-objective optimization
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 -value is properly set for the Minkowski distance calculated in the two indicators. Thereafter, a reinforcement knowledge-sharing mechanism is proposed to derive the -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.
期刊介绍:
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.