进化动态多目标优化的流形预测策略

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Huaqiang Xu, Zhen Xu, Yumeng Wang, Lijun Li, Yuefeng Zhao, Jingjing Wang
{"title":"进化动态多目标优化的流形预测策略","authors":"Huaqiang Xu,&nbsp;Zhen Xu,&nbsp;Yumeng Wang,&nbsp;Lijun Li,&nbsp;Yuefeng Zhao,&nbsp;Jingjing Wang","doi":"10.1016/j.swevo.2025.102103","DOIUrl":null,"url":null,"abstract":"<div><div>Prediction-based evolutionary algorithms have shown impressive effectiveness in solving dynamic multiobjective optimization problems (DMOPs). Typically, these algorithms utilize the historical information of specific representative points, such as center and knee points, to predict the moving trend of the Pareto-optimal set (PS). However, the changing pattern of PS may be inconsistent with that of the representative points, potentially leading to inaccurate prediction of the new PS. Manifold learning captures the overall distribution of PS. Therefore, the changing trend of the manifold reflects the changing pattern of PS. This work introduces a manifold prediction strategy (MPS) for evolutionary dynamic multiobjective optimization algorithms. The MPS predicts the manifold of the PS in a new environment based on the trend observed in historical PSs. Specifically, the Local Principal Component Analysis (LPCA) algorithm is enhanced to learn the manifolds of historical PSs. Using these learned manifolds, MPS estimates the manifold of the PS in the new environment with a linear prediction model. Recognizing that the accuracy of manifold learning results will affect the accuracy of manifold prediction, two methods are proposed to improve the learning results. These methods focus on determining an appropriate number of local manifolds and reducing the randomness during the modeling process. The proposed MPS is tested and compared with several state-of-the-art dynamic multiobjective evolutionary algorithms on various benchmark test instances. Experimental results indicate that MPS outperforms other algorithms on most instances.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"98 ","pages":"Article 102103"},"PeriodicalIF":8.5000,"publicationDate":"2025-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A manifold prediction strategy for evolutionary dynamic multiobjective optimization\",\"authors\":\"Huaqiang Xu,&nbsp;Zhen Xu,&nbsp;Yumeng Wang,&nbsp;Lijun Li,&nbsp;Yuefeng Zhao,&nbsp;Jingjing Wang\",\"doi\":\"10.1016/j.swevo.2025.102103\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Prediction-based evolutionary algorithms have shown impressive effectiveness in solving dynamic multiobjective optimization problems (DMOPs). Typically, these algorithms utilize the historical information of specific representative points, such as center and knee points, to predict the moving trend of the Pareto-optimal set (PS). However, the changing pattern of PS may be inconsistent with that of the representative points, potentially leading to inaccurate prediction of the new PS. Manifold learning captures the overall distribution of PS. Therefore, the changing trend of the manifold reflects the changing pattern of PS. This work introduces a manifold prediction strategy (MPS) for evolutionary dynamic multiobjective optimization algorithms. The MPS predicts the manifold of the PS in a new environment based on the trend observed in historical PSs. Specifically, the Local Principal Component Analysis (LPCA) algorithm is enhanced to learn the manifolds of historical PSs. Using these learned manifolds, MPS estimates the manifold of the PS in the new environment with a linear prediction model. Recognizing that the accuracy of manifold learning results will affect the accuracy of manifold prediction, two methods are proposed to improve the learning results. These methods focus on determining an appropriate number of local manifolds and reducing the randomness during the modeling process. The proposed MPS is tested and compared with several state-of-the-art dynamic multiobjective evolutionary algorithms on various benchmark test instances. Experimental results indicate that MPS outperforms other algorithms on most instances.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"98 \",\"pages\":\"Article 102103\"},\"PeriodicalIF\":8.5000,\"publicationDate\":\"2025-07-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/S2210650225002615\",\"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/S2210650225002615","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

基于预测的进化算法在求解动态多目标优化问题(dops)方面显示出令人印象深刻的有效性。通常,这些算法利用特定代表性点(如中心点和膝盖点)的历史信息来预测帕累托最优集(PS)的移动趋势。然而,PS的变化模式可能与代表点的变化模式不一致,可能导致对新PS的预测不准确。流形学习捕获PS的整体分布,因此流形的变化趋势反映了PS的变化模式。本文介绍了一种用于进化动态多目标优化算法的流形预测策略(MPS)。MPS根据历史PS中观察到的趋势预测新环境下PS的变化。具体来说,改进了局部主成分分析(LPCA)算法来学习历史ps的流形。利用这些学习到的流形,MPS用线性预测模型估计新环境下PS的流形。认识到流形学习结果的准确性会影响流形预测的准确性,提出了两种提高学习结果的方法。这些方法的重点是确定适当数量的局部流形,并减少建模过程中的随机性。在不同的基准测试实例上,对所提出的多目标动态进化算法进行了测试和比较。实验结果表明,在大多数情况下,MPS优于其他算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A manifold prediction strategy for evolutionary dynamic multiobjective optimization
Prediction-based evolutionary algorithms have shown impressive effectiveness in solving dynamic multiobjective optimization problems (DMOPs). Typically, these algorithms utilize the historical information of specific representative points, such as center and knee points, to predict the moving trend of the Pareto-optimal set (PS). However, the changing pattern of PS may be inconsistent with that of the representative points, potentially leading to inaccurate prediction of the new PS. Manifold learning captures the overall distribution of PS. Therefore, the changing trend of the manifold reflects the changing pattern of PS. This work introduces a manifold prediction strategy (MPS) for evolutionary dynamic multiobjective optimization algorithms. The MPS predicts the manifold of the PS in a new environment based on the trend observed in historical PSs. Specifically, the Local Principal Component Analysis (LPCA) algorithm is enhanced to learn the manifolds of historical PSs. Using these learned manifolds, MPS estimates the manifold of the PS in the new environment with a linear prediction model. Recognizing that the accuracy of manifold learning results will affect the accuracy of manifold prediction, two methods are proposed to improve the learning results. These methods focus on determining an appropriate number of local manifolds and reducing the randomness during the modeling process. The proposed MPS is tested and compared with several state-of-the-art dynamic multiobjective evolutionary algorithms on various benchmark test instances. Experimental results indicate that MPS outperforms other algorithms on most instances.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信