Division-selection transfer learning for prediction based dynamic multi-objective optimization

IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Hongye Li, Fan Liang, Yulu Liu, Quanheng Zheng, Kunru Guo
{"title":"Division-selection transfer learning for prediction based dynamic multi-objective optimization","authors":"Hongye Li, Fan Liang, Yulu Liu, Quanheng Zheng, Kunru Guo","doi":"10.1007/s40747-024-01656-0","DOIUrl":null,"url":null,"abstract":"<p>Dynamic multi-objective optimization problems (DMOPs) are challenging as they require capturing the Pareto optimal front (POF) and Pareto optimal set (POS) during the optimization process. In recent years, transfer learning (TL) has emerged the empirical knowledge and is an effective approach to solve DMOPs. However, negative transfer can occur when the transfer method is not suitable for the transfer task. It may deviate the search path and seriously reduce the efficiency, so how to reduce the occurrence of negative transfer to save the running time of dynamic multi-objective evolutionary algorithm (DMOEA) is an important issue to be addressed. A division-selection transfer learning evolutionary algorithm for dynamic multi-objective optimization (DST-DMOEA) is designed towards this aim. Specifically, individuals with high Spearman correlation are relatively stable in different environments, selecting them to train the Support Vector Regression (SVR) model ensures a more accurate capture of solution features, predicting the objective values of historical solutions based on the model, and thus divide historical solutions into elite and non-elite solutions. Subsequently, for the elite solutions, individual TL that incorporates local information for optimization and transfer is used, while the non-elite solutions are handled with manifold TL method to obtain the overall data distribution and understand the internal structure. Then, merge the predicted individuals generated by two parts of TL will constitute as the initial population in the optimization process. Compared with other algorithms, the initial solution of DST-DMOEA is closer to the real POF, effectively reducing negative transfer. In addition, in 51 test instances, DST-DMOEA has shown superior performance in over 30 instances.</p>","PeriodicalId":10524,"journal":{"name":"Complex & Intelligent Systems","volume":"88 1","pages":""},"PeriodicalIF":5.0000,"publicationDate":"2024-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complex & Intelligent Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s40747-024-01656-0","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Dynamic multi-objective optimization problems (DMOPs) are challenging as they require capturing the Pareto optimal front (POF) and Pareto optimal set (POS) during the optimization process. In recent years, transfer learning (TL) has emerged the empirical knowledge and is an effective approach to solve DMOPs. However, negative transfer can occur when the transfer method is not suitable for the transfer task. It may deviate the search path and seriously reduce the efficiency, so how to reduce the occurrence of negative transfer to save the running time of dynamic multi-objective evolutionary algorithm (DMOEA) is an important issue to be addressed. A division-selection transfer learning evolutionary algorithm for dynamic multi-objective optimization (DST-DMOEA) is designed towards this aim. Specifically, individuals with high Spearman correlation are relatively stable in different environments, selecting them to train the Support Vector Regression (SVR) model ensures a more accurate capture of solution features, predicting the objective values of historical solutions based on the model, and thus divide historical solutions into elite and non-elite solutions. Subsequently, for the elite solutions, individual TL that incorporates local information for optimization and transfer is used, while the non-elite solutions are handled with manifold TL method to obtain the overall data distribution and understand the internal structure. Then, merge the predicted individuals generated by two parts of TL will constitute as the initial population in the optimization process. Compared with other algorithms, the initial solution of DST-DMOEA is closer to the real POF, effectively reducing negative transfer. In addition, in 51 test instances, DST-DMOEA has shown superior performance in over 30 instances.

基于预测的动态多目标优化的分部选择迁移学习
动态多目标优化问题(DMOPs)要求在优化过程中捕捉帕累托最优前沿(POF)和帕累托最优集(POS),因此极具挑战性。近年来,迁移学习(TL)已成为一种经验知识,也是解决 DMOP 的一种有效方法。然而,当迁移方法不适合迁移任务时,就会出现负迁移。因此,如何减少负迁移的发生以节省动态多目标进化算法(DMOEA)的运行时间是一个亟待解决的重要问题。为此,我们设计了一种用于动态多目标优化的分选转移学习进化算法(DST-DMOEA)。具体来说,斯皮尔曼相关性高的个体在不同环境中相对稳定,选择它们来训练支持向量回归(SVR)模型可确保更准确地捕捉解的特征,并根据模型预测历史解的目标值,从而将历史解分为精英解和非精英解。随后,对于精英解,使用结合局部信息的个体 TL 进行优化和转移,而对于非精英解,则使用流形 TL 方法进行处理,以获得整体数据分布并了解内部结构。然后,将两部分 TL 生成的预测个体合并,构成优化过程中的初始种群。与其他算法相比,DST-DMOEA 的初始解更接近真实 POF,有效减少了负迁移。此外,在 51 个测试实例中,DST-DMOEA 在 30 多个实例中表现出优异的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Complex & Intelligent Systems
Complex & Intelligent Systems COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
9.60
自引率
10.30%
发文量
297
期刊介绍: Complex & Intelligent Systems aims to provide a forum for presenting and discussing novel approaches, tools and techniques meant for attaining a cross-fertilization between the broad fields of complex systems, computational simulation, and intelligent analytics and visualization. The transdisciplinary research that the journal focuses on will expand the boundaries of our understanding by investigating the principles and processes that underlie many of the most profound problems facing society today.
×
引用
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学术官方微信