{"title":"基于趋势分析的动态多目标进化优化预测策略","authors":"Anran Cao , Xiaoli Li , Kang Wang","doi":"10.1016/j.swevo.2025.102166","DOIUrl":null,"url":null,"abstract":"<div><div>Dynamic multiobjective optimization problems (DMOPs) change over time, which require Evolutionary algorithms (EA) to track Pareto-optimal solutions (PS) and/or Pareto-optimal front (PF) in a dynamic environment. Most prediction-based algorithms solely use a single model to learn the changing pattern for solution prediction. In the face of complex DMOPs, they may achieve an unsatisfactory performance. To address this issue, a novel trend analysis-based prediction strategy (TAP) is proposed in this paper. Based on previous population information, a simple trend analysis is designed to extract the changing pattern of each solution, and classify them into different types: irregular, translational, and stationary. For irregular changing solutions, a neural network nonlinear model is presented to predict the new location. For translational changing solutions, a simple linear model is built to estimate their new positions. For stationary solutions, they are preserved. As a result, TAP is more responsive to different dynamic environments. TAP is incorporated into the dynamic multiobjective evolutionary algorithm (DMOEA) based on decomposition (MOEA/D) to construct a novel algorithm denoted as MOEA/D-TAP. To verify the performance of the proposed method, comparison experiments are carried out on 26 test instances of four different benchmarks compared with six state-of-the-art methods. The test results indicate that TAP is highly competitive.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"99 ","pages":"Article 102166"},"PeriodicalIF":8.5000,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Trend analysis-based prediction strategies for dynamic multi-objective evolutionary optimization\",\"authors\":\"Anran Cao , Xiaoli Li , Kang Wang\",\"doi\":\"10.1016/j.swevo.2025.102166\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Dynamic multiobjective optimization problems (DMOPs) change over time, which require Evolutionary algorithms (EA) to track Pareto-optimal solutions (PS) and/or Pareto-optimal front (PF) in a dynamic environment. Most prediction-based algorithms solely use a single model to learn the changing pattern for solution prediction. In the face of complex DMOPs, they may achieve an unsatisfactory performance. To address this issue, a novel trend analysis-based prediction strategy (TAP) is proposed in this paper. Based on previous population information, a simple trend analysis is designed to extract the changing pattern of each solution, and classify them into different types: irregular, translational, and stationary. For irregular changing solutions, a neural network nonlinear model is presented to predict the new location. For translational changing solutions, a simple linear model is built to estimate their new positions. For stationary solutions, they are preserved. As a result, TAP is more responsive to different dynamic environments. TAP is incorporated into the dynamic multiobjective evolutionary algorithm (DMOEA) based on decomposition (MOEA/D) to construct a novel algorithm denoted as MOEA/D-TAP. To verify the performance of the proposed method, comparison experiments are carried out on 26 test instances of four different benchmarks compared with six state-of-the-art methods. The test results indicate that TAP is highly competitive.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"99 \",\"pages\":\"Article 102166\"},\"PeriodicalIF\":8.5000,\"publicationDate\":\"2025-09-23\",\"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/S2210650225003232\",\"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/S2210650225003232","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Trend analysis-based prediction strategies for dynamic multi-objective evolutionary optimization
Dynamic multiobjective optimization problems (DMOPs) change over time, which require Evolutionary algorithms (EA) to track Pareto-optimal solutions (PS) and/or Pareto-optimal front (PF) in a dynamic environment. Most prediction-based algorithms solely use a single model to learn the changing pattern for solution prediction. In the face of complex DMOPs, they may achieve an unsatisfactory performance. To address this issue, a novel trend analysis-based prediction strategy (TAP) is proposed in this paper. Based on previous population information, a simple trend analysis is designed to extract the changing pattern of each solution, and classify them into different types: irregular, translational, and stationary. For irregular changing solutions, a neural network nonlinear model is presented to predict the new location. For translational changing solutions, a simple linear model is built to estimate their new positions. For stationary solutions, they are preserved. As a result, TAP is more responsive to different dynamic environments. TAP is incorporated into the dynamic multiobjective evolutionary algorithm (DMOEA) based on decomposition (MOEA/D) to construct a novel algorithm denoted as MOEA/D-TAP. To verify the performance of the proposed method, comparison experiments are carried out on 26 test instances of four different benchmarks compared with six state-of-the-art methods. The test results indicate that TAP is highly competitive.
期刊介绍:
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.