期刊
JOURNAL OF COMPUTATIONAL DESIGN AND ENGINEERING
卷 10, 期 1, 页码 1-15出版社
OXFORD UNIV PRESS
DOI: 10.1093/jcde/qwac124
关键词
dynamic multi-objective optimization; prediction; diversity maintenance strategy; knee point; close-to-boundary point; convergence
In this paper, a prediction approach based on diversity screening and special point prediction (DSSP) is proposed to tackle the dynamic optimization issue. The approach includes a decision variable clustering and screening strategy as well as a method for predicting special points. Experimental results demonstrate the effectiveness of the proposed algorithm, DSSP.
The dynamic multi-objective optimization problem (DMOP) is a common problem in optimization problems; the main reasons are the objective's conflict and environment changes. In this paper, we provide a prediction approach based on diversity screening and special point prediction (DSSP) to tackle the dynamic optimization issue. First, we introduce a decision variable clustering and screening strategy that clusters the decision space of the non-dominated solution set to find the cluster centroids and then employs a decision variable screening strategy to filter out solutions that have an impact on the distribution of individuals. This approach can broaden the range of dynamic multi-objective optimization algorithms. Second, an approach for predicting special points is suggested. The algorithm's convergence is improved following environmental changes by forecasting the special point tracking Pareto front in the object space. Finally, the forward-looking center points are used to predict the non-dominated solution set and eliminate the useless individuals in the population. The prediction strategy can help the solution set converge while maintaining its diversity, which is compared with the four other state-of-the-art strategies. Our experimental results demonstrate that the proposed algorithm, DSSP, can effectively tackle DMOPs.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据