多目标优化
计算机科学
进化算法
数学优化
人口
集合(抽象数据类型)
点(几何)
最优化问题
帕累托原理
数学
人工智能
算法
几何学
社会学
人口学
程序设计语言
作者
Juan Zou,Qingya Li,Shengxiang Yang,Hui Bai,Jinhua Zheng
标识
DOI:10.1016/j.asoc.2017.08.004
摘要
In real life, there are many dynamic multi-objective optimization problems which vary over time, requiring an optimization algorithm to track the movement of the Pareto front (Pareto set) with time. In this paper, we propose a novel prediction strategy based on center points and knee points (CKPS) consisting of three mechanisms. First, a method of predicting the non-dominated set based on the forward-looking center points is proposed. Second, the knee point set is introduced to the predicted population to predict accurately the location and distribution of the Pareto front after an environmental change. Finally, an adaptive diversity maintenance strategy is proposed, which can generate some random individuals of the corresponding number according to the degree of difficulty of the problem to maintain the diversity of the population. The proposed strategy is compared with four other state-of-the-art strategies. The experimental results show that CKPS is effective for evolutionary dynamic multi-objective optimization.
科研通智能强力驱动
Strongly Powered by AbleSci AI