结合元学习和强化学习的离线-在线学习框架,用于进化多目标优化

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Shuxiang Li , Yongsheng Pang , Zhaorong Huang , Xianghua Chu
{"title":"结合元学习和强化学习的离线-在线学习框架,用于进化多目标优化","authors":"Shuxiang Li ,&nbsp;Yongsheng Pang ,&nbsp;Zhaorong Huang ,&nbsp;Xianghua Chu","doi":"10.1016/j.swevo.2025.102037","DOIUrl":null,"url":null,"abstract":"<div><div>Many multi-objective evolutionary algorithms (MOEAs) have been proposed in addressing the multi-objective optimization problems (MOPs). However, the performance of MOEAs varies significantly across various MOPs and there is no single MOEA that performs well on all MOP instances. In addition, existing methods for adaptive MOEA selection still face limitations, which restrict the further optimization for MOPs. To fill these gaps and improve the efficiency of solving MOPs, this study proposes an offline-online learning framework combining meta-learning and reinforcement learning (O<sup>2</sup>-MRL). Instead of proposing a new MOEA or optimizing a strategy, O<sup>2</sup>-MRL solves MOPs by taking full advantage of the existing MOEAs and addresses the limitations of existing MOEA selection methods. O<sup>2</sup>-MRL can adaptively select the appropriate MOEAs for various types of MOPs with different dimensions (Offline) and automatically schedule the selected MOEAs during the optimization process (Online), offering a new idea for optimizing MOPs. To evaluate the performance of the proposed O<sup>2</sup>-MRL, forty-seven benchmark MOPs are used as instances, and nine representative MOEAs are selected for comparison. Comprehensive experiments demonstrate the significant efficiency of O<sup>2</sup>-MRL, as it achieves optimal solutions in 60.28 % of the MOPs across different dimensions and improves the optimization results in 48.23 % of them, with an average improvement of 8.72 %. In addition to maintaining high optimization performance, O<sup>2</sup>-MRL also demonstrates superior convergence speed and stability across various types of MOPs. Two real-world MOPs are employed to evaluate the practicality of O<sup>2</sup>-MRL, and the experimental results indicate that it achieves optimal solutions in both cases.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"97 ","pages":"Article 102037"},"PeriodicalIF":8.5000,"publicationDate":"2025-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An offline-online learning framework combining meta-learning and reinforcement learning for evolutionary multi-objective optimization\",\"authors\":\"Shuxiang Li ,&nbsp;Yongsheng Pang ,&nbsp;Zhaorong Huang ,&nbsp;Xianghua Chu\",\"doi\":\"10.1016/j.swevo.2025.102037\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Many multi-objective evolutionary algorithms (MOEAs) have been proposed in addressing the multi-objective optimization problems (MOPs). However, the performance of MOEAs varies significantly across various MOPs and there is no single MOEA that performs well on all MOP instances. In addition, existing methods for adaptive MOEA selection still face limitations, which restrict the further optimization for MOPs. To fill these gaps and improve the efficiency of solving MOPs, this study proposes an offline-online learning framework combining meta-learning and reinforcement learning (O<sup>2</sup>-MRL). Instead of proposing a new MOEA or optimizing a strategy, O<sup>2</sup>-MRL solves MOPs by taking full advantage of the existing MOEAs and addresses the limitations of existing MOEA selection methods. O<sup>2</sup>-MRL can adaptively select the appropriate MOEAs for various types of MOPs with different dimensions (Offline) and automatically schedule the selected MOEAs during the optimization process (Online), offering a new idea for optimizing MOPs. To evaluate the performance of the proposed O<sup>2</sup>-MRL, forty-seven benchmark MOPs are used as instances, and nine representative MOEAs are selected for comparison. Comprehensive experiments demonstrate the significant efficiency of O<sup>2</sup>-MRL, as it achieves optimal solutions in 60.28 % of the MOPs across different dimensions and improves the optimization results in 48.23 % of them, with an average improvement of 8.72 %. In addition to maintaining high optimization performance, O<sup>2</sup>-MRL also demonstrates superior convergence speed and stability across various types of MOPs. Two real-world MOPs are employed to evaluate the practicality of O<sup>2</sup>-MRL, and the experimental results indicate that it achieves optimal solutions in both cases.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"97 \",\"pages\":\"Article 102037\"},\"PeriodicalIF\":8.5000,\"publicationDate\":\"2025-06-14\",\"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/S2210650225001956\",\"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/S2210650225001956","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

为了解决多目标优化问题,人们提出了许多多目标进化算法(moea)。然而,MOEA的性能在不同的MOP之间差异很大,并且没有一个MOEA在所有MOP实例上都表现良好。此外,现有的自适应MOEA选择方法仍然存在局限性,这限制了MOEA的进一步优化。为了填补这些空白并提高MOPs的求解效率,本研究提出了一种结合元学习和强化学习(O2-MRL)的离线-在线学习框架。O2-MRL没有提出新的MOEA或优化策略,而是通过充分利用现有MOEA来解决moops问题,并解决了现有MOEA选择方法的局限性。O2-MRL可以针对不同尺寸的不同类型MOPs自适应选择合适的moea (Offline),并在优化过程中自动调度所选择的moea (Online),为优化MOPs提供了一种新的思路。为了评估所提出的O2-MRL的性能,以47个基准mop作为实例,并选择了9个具有代表性的moea进行比较。综合实验表明,O2-MRL的效率显著,60.28%的MOPs得到了不同维度的最优解,48.23%的优化结果得到了改善,平均提高了8.72%。除了保持较高的优化性能外,O2-MRL还在各种类型的MOPs中表现出卓越的收敛速度和稳定性。利用两个实际的MOPs对O2-MRL的实用性进行了评估,实验结果表明,在这两种情况下,它都得到了最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An offline-online learning framework combining meta-learning and reinforcement learning for evolutionary multi-objective optimization
Many multi-objective evolutionary algorithms (MOEAs) have been proposed in addressing the multi-objective optimization problems (MOPs). However, the performance of MOEAs varies significantly across various MOPs and there is no single MOEA that performs well on all MOP instances. In addition, existing methods for adaptive MOEA selection still face limitations, which restrict the further optimization for MOPs. To fill these gaps and improve the efficiency of solving MOPs, this study proposes an offline-online learning framework combining meta-learning and reinforcement learning (O2-MRL). Instead of proposing a new MOEA or optimizing a strategy, O2-MRL solves MOPs by taking full advantage of the existing MOEAs and addresses the limitations of existing MOEA selection methods. O2-MRL can adaptively select the appropriate MOEAs for various types of MOPs with different dimensions (Offline) and automatically schedule the selected MOEAs during the optimization process (Online), offering a new idea for optimizing MOPs. To evaluate the performance of the proposed O2-MRL, forty-seven benchmark MOPs are used as instances, and nine representative MOEAs are selected for comparison. Comprehensive experiments demonstrate the significant efficiency of O2-MRL, as it achieves optimal solutions in 60.28 % of the MOPs across different dimensions and improves the optimization results in 48.23 % of them, with an average improvement of 8.72 %. In addition to maintaining high optimization performance, O2-MRL also demonstrates superior convergence speed and stability across various types of MOPs. Two real-world MOPs are employed to evaluate the practicality of O2-MRL, and the experimental results indicate that it achieves optimal solutions in both cases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信