期刊
APPLIED SOFT COMPUTING
卷 107, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.asoc.2021.107258
关键词
Dynamic multi-objective optimization; Evolutionary computation; Prediction-based methods; Forecast; Probabilistic modeling
资金
- CAPES (Brazil)
Dynamic multi-objective evolutionary algorithms can address multi-objective optimization problems by predicting and responding to changes, with prediction-based methods showing promise. Through the use of objective space prediction strategy and change reaction mechanism, the proposed DOSP-NSDE demonstrates competitiveness in experiments.
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据