Trend analysis-based prediction strategies for dynamic multi-objective evolutionary optimization

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Anran Cao , Xiaoli Li , Kang Wang
{"title":"Trend analysis-based prediction strategies for dynamic multi-objective evolutionary optimization","authors":"Anran Cao ,&nbsp;Xiaoli Li ,&nbsp;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}
引用次数: 0

Abstract

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.
基于趋势分析的动态多目标进化优化预测策略
动态多目标优化问题(dops)随着时间的变化而变化,这需要进化算法(EA)在动态环境中跟踪帕累托最优解(PS)和/或帕累托最优前沿(PF)。大多数基于预测的算法仅使用单个模型来学习解决方案预测的变化模式。面对复杂的dmp,它们可能会取得令人不满意的性能。为了解决这一问题,本文提出了一种新的基于趋势分析的预测策略。基于以往的人口信息,设计了一个简单的趋势分析来提取每个解决方案的变化模式,并将其分为不规则、平移和平稳三类。对于不规则变化解,提出了一种神经网络非线性模型来预测新的位置。对于平移变化解,建立了一个简单的线性模型来估计它们的新位置。对于固定溶液,它们是保留的。因此,TAP对不同的动态环境更敏感。将TAP算法与基于分解的动态多目标进化算法(MOEA/D)相结合,构造了一种新的算法MOEA/D-TAP。为了验证该方法的性能,在4种不同基准的26个测试实例上与6种最先进的方法进行了对比实验。测试结果表明,TAP具有很强的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
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学术官方微信