The effect of diversity maintenance on prediction in dynamic multi-objective optimization

被引:140
作者
Ruan, Gan [1 ]
Yu, Guo [4 ]
Zheng, Jinhua [1 ,2 ,3 ]
Zou, Juan [1 ]
Yang, Shengxiang [5 ]
机构
[1] Xiangtan Univ, Informat Engn Coll, Minist Educ, Key Lab Intelligent Comp & Informat Proc, Xiangtan, Hunan, Peoples R China
[2] Hengyang Normal Univ, Minist Educ, Hengyang, Hunan, Peoples R China
[3] Hengyang Normal Univ, Sch Comp Sci & Technol, Hengyang, Hunan, Peoples R China
[4] Univ Surrey, Comp Sci, Guildford GU2 7XH, Surrey, England
[5] De Montfort Univ, Sch Comp Sci & Informat, Leicester LE1 9BH, Leics, England
基金
中国国家自然科学基金;
关键词
Dynamic multi-objective optimization; Evolutionary algorithms; Diversity maintenance; Prediction; ALGORITHM; STRATEGY;
D O I
10.1016/j.asoc.2017.05.008
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
There are many dynamic multi-objective optimization problems (DMOPs) in real-life engineering applications whose objectives change over time. After an environmental change occurs, prediction strategies are commonly used in dynamic multi-objective optimization algorithms to find the new Pareto optimal set (POS). Being able to make more accurate prediction means the algorithm requires fewer computational resources to make the population approximate to the Pareto optimal front (POF). This paper proposes a hybrid diversity maintenance method to improve prediction accuracy. The method consists of three steps, which are implemented after an environmental change. The first step, based on the moving direction of the center points, uses the prediction to relocate a number of solutions close to the new Pareto front. On the basis of self-defined minimum and maximum points of the POS in this paper, the second step applies the gradual search to produce some well-distributed solutions in the decision space so as to compensate for the inaccuracy of the first step, simultaneously and further enhancing the convergence and diversity of the population. In the third step, some diverse individuals are randomly generated within the region of next probable POS, which prompts the diversity of the population. Eventually the prediction becomes more accurate as the solutions with good convergence and diversity are selected after the non-dominated sort [1] on the combined solutions generated by the three steps. Compared with three other prediction methods on a series of test instances, our method is very competitive in convergence and diversity as well as the speed at which it responds to environmental changes. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:631 / 647
页数:17
相关论文
共 45 条
  • [1] [Anonymous], 2006, P 8 ANN C GEN EV COM
  • [2] 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
  • [3] Branke J., 2012, Evolutionary optimization in dynamic environments, V3
  • [4] Chun'an L., 2009, J SYST ENG ELECTRON, V20, P204
  • [5] Coello C.A. Coello., 2006, Computational Intelligence, P73
  • [6] 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
  • [7] Manríquez AD, 2010, ICAART 2010: PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1: ARTIFICIAL INTELLIGENCE, P337
  • [8] Dynamic multiobjective optimization problems: Test cases, approximations, and applications
    Farina, M
    Deb, K
    Amato, P
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (05) : 425 - 442
  • [9] Goh C.-K., 2009, Issues and Algorithms, Studies in Computational Intelligence, V186
  • [10] Gon C.K., 2009, IEEE T EVOLUT COMPUT, V13, P103