进化动态多目标优化的最近邻回归

IF 6.8 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS
Youpeng Deng , Haobo Gao , Yan Zheng , Zhaopeng Meng , Yueyang Hua , Qiangguo Jin , Leilei Cao
{"title":"进化动态多目标优化的最近邻回归","authors":"Youpeng Deng ,&nbsp;Haobo Gao ,&nbsp;Yan Zheng ,&nbsp;Zhaopeng Meng ,&nbsp;Yueyang Hua ,&nbsp;Qiangguo Jin ,&nbsp;Leilei Cao","doi":"10.1016/j.ins.2025.122513","DOIUrl":null,"url":null,"abstract":"<div><div>Dynamic multi-objective optimization problems (DMOPs), characterized by time-varying objectives and constraints, demand algorithms capable of rapid adaptation while balancing convergence and diversity. Existing evolutionary algorithms are frequently subjected to significant online training costs due to their utilization of data-driven prediction models. A novel hybrid framework, MOEA/D-KNN, is proposed, integrating K-Nearest Neighbor (KNN) regression with the MOEA/D methodology. Within this framework, historical data is leveraged by KNN to dynamically predict Pareto-optimal solutions, enabling rapid adaptation to environmental changes. Simultaneously, the problem is decomposed by MOEA/D to facilitate an effective search strategy. Comprehensive empirical evaluation was conducted on standard DMOP benchmarks across diverse dynamic scenarios. MOEA/D-KNN is demonstrated to outperform state-of-the-art algorithms, particularly in managing abrupt and frequent environmental changes. Machine learning prediction is successfully bridged with evolutionary optimization through this approach, offering a robust and efficient solution for dynamic multi-objective challenges.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"720 ","pages":"Article 122513"},"PeriodicalIF":6.8000,"publicationDate":"2025-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Nearest neighbor regression for evolutionary dynamic multiobjective optimization\",\"authors\":\"Youpeng Deng ,&nbsp;Haobo Gao ,&nbsp;Yan Zheng ,&nbsp;Zhaopeng Meng ,&nbsp;Yueyang Hua ,&nbsp;Qiangguo Jin ,&nbsp;Leilei Cao\",\"doi\":\"10.1016/j.ins.2025.122513\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Dynamic multi-objective optimization problems (DMOPs), characterized by time-varying objectives and constraints, demand algorithms capable of rapid adaptation while balancing convergence and diversity. Existing evolutionary algorithms are frequently subjected to significant online training costs due to their utilization of data-driven prediction models. A novel hybrid framework, MOEA/D-KNN, is proposed, integrating K-Nearest Neighbor (KNN) regression with the MOEA/D methodology. Within this framework, historical data is leveraged by KNN to dynamically predict Pareto-optimal solutions, enabling rapid adaptation to environmental changes. Simultaneously, the problem is decomposed by MOEA/D to facilitate an effective search strategy. Comprehensive empirical evaluation was conducted on standard DMOP benchmarks across diverse dynamic scenarios. MOEA/D-KNN is demonstrated to outperform state-of-the-art algorithms, particularly in managing abrupt and frequent environmental changes. Machine learning prediction is successfully bridged with evolutionary optimization through this approach, offering a robust and efficient solution for dynamic multi-objective challenges.</div></div>\",\"PeriodicalId\":51063,\"journal\":{\"name\":\"Information Sciences\",\"volume\":\"720 \",\"pages\":\"Article 122513\"},\"PeriodicalIF\":6.8000,\"publicationDate\":\"2025-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Information Sciences\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0020025525006450\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"0\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525006450","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

动态多目标优化问题具有时变目标和约束的特点,要求算法能够在平衡收敛性和多样性的同时快速适应。现有的进化算法由于使用数据驱动的预测模型,经常需要大量的在线培训成本。将k -最近邻(KNN)回归与MOEA/D方法相结合,提出了一种新的混合框架MOEA/D-KNN。在这个框架内,KNN利用历史数据来动态预测帕累托最优解决方案,从而能够快速适应环境变化。同时,对问题进行了MOEA/D分解,便于制定有效的搜索策略。对不同动态场景下的标准DMOP基准进行了综合实证评价。MOEA/D-KNN被证明优于最先进的算法,特别是在管理突然和频繁的环境变化方面。该方法成功地将机器学习预测与进化优化相结合,为动态多目标挑战提供了鲁棒高效的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Nearest neighbor regression for evolutionary dynamic multiobjective optimization
Dynamic multi-objective optimization problems (DMOPs), characterized by time-varying objectives and constraints, demand algorithms capable of rapid adaptation while balancing convergence and diversity. Existing evolutionary algorithms are frequently subjected to significant online training costs due to their utilization of data-driven prediction models. A novel hybrid framework, MOEA/D-KNN, is proposed, integrating K-Nearest Neighbor (KNN) regression with the MOEA/D methodology. Within this framework, historical data is leveraged by KNN to dynamically predict Pareto-optimal solutions, enabling rapid adaptation to environmental changes. Simultaneously, the problem is decomposed by MOEA/D to facilitate an effective search strategy. Comprehensive empirical evaluation was conducted on standard DMOP benchmarks across diverse dynamic scenarios. MOEA/D-KNN is demonstrated to outperform state-of-the-art algorithms, particularly in managing abrupt and frequent environmental changes. Machine learning prediction is successfully bridged with evolutionary optimization through this approach, offering a robust and efficient solution for dynamic multi-objective challenges.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
×
引用
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学术官方微信