A novel predictive method based on key points for dynamic multi-objective optimization

被引:15
作者
Wang, Chunfeng [1 ]
Yen, Gary G. [2 ]
Zou, Fei [3 ]
机构
[1] Xianyang Normal Univ, Sch Math & Stat, Xianyang 712000, Peoples R China
[2] Oklahoma State Univ, Sch Elect & Comp Engn, Stillwater, OK 74078 USA
[3] Shenyang Univ Technol, Sch Artificial Intelligence, Shenyang 110870, Peoples R China
关键词
Dynamic multi-objective optimization; TOPSIS; Clustering strategy; Predictive strategy; EVOLUTIONARY ALGORITHM; GENETIC ALGORITHMS; MEMORY; IMMIGRANTS; HYBRID;
D O I
10.1016/j.eswa.2021.116127
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Dynamic multi-objective problem is very difficult to be solved because of the variability of the objective function with time. To overcome the difficult caused by such variability, a predictive method utilizing some key points (including polar points and centroid points) is designed, which contains four critical steps. First, the whole population is automatically divided into multiple clusters, which will be used to preserve a good diversity in the process of population evolution. Second, the technique for order of preference by similarity to ideal solution (TOPSIS), a well-regarded multi-attribute decision making strategy, is exploited to improve its convergence speed further. Third, the polar point and centroid point in each cluster are utilized to obtain the initial population by using sequence predictive method when environmental changes are detected. Fourth, to accelerate the convergence speed, the quantitative value for each individual determined in the prediction process is also used in mating selection and environmental selection. The numerical results imply that the new method can deal with the change of environment effectively and track the Pareto optimal front (POF) quickly. Meanwhile, the comparison results with several selected state-of-the-art methods also show that the overall performance of the proposed method is the best on most benchmark problems.
引用
收藏
页数:12
相关论文
共 46 条
  • [1] A new feature selection method to improve the document clustering using particle swarm optimization algorithm
    Abualigah, Laith Mohammad
    Khader, Ahamad Tajudin
    Hanandeh, Essam Said
    [J]. JOURNAL OF COMPUTATIONAL SCIENCE, 2018, 25 : 456 - 466
  • [2] Weighted pointwise prediction method for dynamic multiobjective optimization
    Ahrari, Ali
    Elsayed, Saber
    Sarker, Ruhul
    Essam, Daryl
    Coello Coello, Carlos A.
    [J]. INFORMATION SCIENCES, 2021, 546 : 349 - 367
  • [3] Aragón V, 2005, J COMPUT SCI TECHNOL, V5, P133
  • [4] Generalized Immigration Schemes for Dynamic Evolutionary Multiobjective Optimization
    Azevedo, Carlos R. B.
    Araujo, Aluizio F. R.
    [J]. 2011 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2011, : 2033 - 2040
  • [5] A dynamic multi-objective evolutionary algorithm using a change severity-based adaptive population management strategy
    Azzouz, Radhia
    Bechikh, Slim
    Ben Said, Lamjed
    [J]. SOFT COMPUTING, 2017, 21 (04) : 885 - 906
  • [6] Azzouz R, 2014, 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P3168, DOI 10.1109/CEC.2014.6900569
  • [7] Branke J., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1875, DOI 10.1109/CEC.1999.785502
  • [8] Decomposition-based evolutionary dynamic multiobjective optimization using a difference model
    Cao, Leilei
    Xu, Lihong
    Goodman, Erik D.
    Li, Hui
    [J]. APPLIED SOFT COMPUTING, 2019, 76 : 473 - 490
  • [9] Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems
    Das, I
    Dennis, JE
    [J]. SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) : 631 - 657
  • [10] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197