.png){kind=icon}
返回
Dynamic multi-objective evolutionary algorithm with objective space prediction strategy
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2021.107258.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To solve dynamic multi-objective optimization problems, a dynamic multi-objective evolutionary algorithm (DMOEA) must be able to deal with the dynamics of the environment, and such modifications can lead to new optimal solutions over time. Various algorithms have been proposed that modify the way a change is handled. Among them, prediction-based methods are promising for solving this kind of problem. They provide guided direction for population evolution through a prediction mechanism that assists the DMOEA to respond quickly to new changes. Based on these strategies, we propose a dynamic non-dominated sorting differential evolution improvement with prediction in the objective space (DOSP-NSDE). The proposal uses the objective space prediction (OSP) strategy for both the static evolutionary process (between changes) and the change reaction mechanism to predict the new optimal front location. Experiments were performed on a real-world problem and four sets of test problems: FDA, dMOP, UDF, and DF. Comparison of DOSP-NSDE with several algorithms in the literature, considering three metrics, is presented, showing that the proposal is competitive with most problems. (C) 2021 Elsevier B.V. All rights reserved.
Keyword:
Dynamic multi-objective optimization
Evolutionary computation
Prediction-based methods
Forecast
Probabilistic modeling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
A directed search strategy for evolutionary dynamic multiobjective optimization.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏An orthogonal predictive model-based dynamic multi-objective optimization algorithmSOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏分享收藏
查看更多内容