{"title":"进化动态多目标优化的流形预测策略","authors":"Huaqiang Xu, Zhen Xu, Yumeng Wang, Lijun Li, Yuefeng Zhao, 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, Zhen Xu, Yumeng Wang, Lijun Li, Yuefeng Zhao, 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}
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 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.