A Dynamic Multiobjective Optimization Algorithm with a New Prediction Model

被引:0
|
作者
Li Z. [1 ]
Li Y. [1 ]
He L. [1 ]
Shen C. [2 ]
机构
[1] National Key Laboratory of Science and Technology on Blind Signal Processing, Chengdu
[2] MOE Key Lab for Intelligent Networks and Network Security, Xi'an Jiaotong University, Xi'an
来源
Shen, Chao | 2018年 / Xi'an Jiaotong University卷 / 52期
关键词
Dynamic multiobjective optimization; Evolutionary algorithm; Kalman filter; Prediction model;
D O I
10.7652/xjtuxb201810002
中图分类号
学科分类号
摘要
A new dynamic multiobjective optimization algorithm is proposed to solve the problem that the existing dynamic multiobjective optimization algorithms have poor ability to track the rapid changing optimal solutions for practical applications, and the algorithm uses a new prediction model that combines the prediction value of central point and the vertical disturbance component. First, the central point of the optimal solution set before change is calculated as a prediction object, which changes the way that all solutions are usually used for prediction and improves the efficiency of the algorithm. Second, the history information of the algorithmic iterations is combined to select the location, velocity and acceleration as a state vector of prediction. The tracking ability for change in the solution set is ensured in most circumstances. At last, a hyperplane random disturbance that is perpendicular to the predicted direction of change is added to the predicted new solution to enhance the diversity of the knowledge set, and the convergence speed of the algorithm is improved. Experimental results show that the proposed algorithm is superior to the other 3 state-of-the-art dynamic multiobjective evolutionary algorithms in 75% test cases, and the run time of the algorithm is 39% lower than those of dynamic multiobjective optimization algorithms based on Kalman filter. © 2018, Editorial Office of Journal of Xi'an Jiaotong University. All right reserved.
引用
收藏
页码:8 / 15
页数:7
相关论文
共 24 条
  • [1] Nguyen S., Zhang M., Johnston M., Et al., Automatic design of scheduling policies for dynamic multi-objective job shop scheduling via cooperative coevolution genetic programming, IEEE Transactions on Evolutionary Computation, 18, 2, pp. 193-208, (2014)
  • [2] Marichelvam M.K., Prabaharan T., Yang X.S., A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems, IEEE Transactions on Evolutionary Computation, 18, 2, pp. 301-305, (2014)
  • [3] Nguyen T.T., Continuous dynamic optimisation using evolutionary algorithms, pp. 161-220, (2011)
  • [4] Gee S.B., Tan K.C., Alippi C., Solving multiobjective optimization problems in unknown dynamic environments: an inverse modeling approach, IEEE Transactions on Cybernetics, 47, 12, pp. 4223-4234, (2017)
  • [5] Morrison R.W., Designing Evolutionary Algorithms for Dynamic Environments, pp. 25-69, (2003)
  • [6] Riekert M., Malan K.M., Engelbrect A.P., Adaptive genetic programming for dynamic classification problems, IEEE Congress on Evolutionary Computation, pp. 674-681, (2009)
  • [7] Woldesenbet Y.G., Yen G.G., Dynamic evolutionary algorithm with variable relocation, IEEE Transactions on Evolutionary Computation, 13, 3, pp. 500-513, (2009)
  • [8] Zhang S., Li Z., Chen S., Et al., Dynamic multi-objective optimization algorithm based on ecological strategy, Journal of Computer Research and Development, 51, 6, pp. 1313-1330, (2014)
  • [9] Liu M., Zeng W., Liu Y., Bunchy memo method for dynamic evolutionary multi-objective optimization, Computer Science, 43, 12, pp. 241-247, (2016)
  • [10] Jiang S., Yang S., A steady-state and generational evolutionary algorithm for dynamic multiobjective optimization, IEEE Transactions on Evolutionary Computation, 21, 1, pp. 65-82, (2017)