Multiobjective Infill Criterion Driven Gaussian Process-Assisted Particle Swarm Optimization of High-Dimensional Expensive Problems

被引:153
作者
Tian, Jie [1 ,2 ]
Tan, Ying [3 ]
Zeng, Jianchao [1 ,4 ]
Sun, Chaoli [3 ]
Jin, Yaochu [3 ,5 ]
机构
[1] Taiyuan Univ Sci & Technol, Coll Mech Engn, Taiyuan 030024, Shanxi, Peoples R China
[2] Shandong Womens Univ, Sch Data & Comp Sci, Jinan 250300, Shandong, Peoples R China
[3] Taiyuan Univ Sci & Technol, Dept Comp Sci & Technol, Taiyuan 030024, Shanxi, Peoples R China
[4] North Univ China, Sch Comp Sci & Control Engn, Taiyuan 030051, Shanxi, Peoples R China
[5] Univ Surrey, Dept Comp Sci, Guildford GU2 7XH, Surrey, England
基金
英国工程与自然科学研究理事会; 中国国家自然科学基金;
关键词
Expensive optimization; Gaussian process (GP); multiobjective Will criterion (MIC); social learning particle swarm optimization (SL-PSO); EVOLUTIONARY OPTIMIZATION; FITNESS APPROXIMATION; EXPECTED IMPROVEMENT; GLOBAL OPTIMIZATION; ALGORITHM; NETWORKS; FASTER;
D O I
10.1109/TEVC.2018.2869247
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Model management plays an essential role in surrogate-assisted evolutionary optimization of expensive problems, since the strategy for selecting individuals for fitness evaluation using the real objective function has substantial influences on the final performance. Among many others, infill criterion driven Gaussian process (GP)-assisted evolutionary algorithms have been demonstrated competitive for optimization of problems with up to 50 decision variables. In this paper, a multiobjective infill criterion (MIC) that considers the approximated fitness and the approximation uncertainty as two objectives is proposed for a GP-assisted social learning particle swarm optimization algorithm. The MIC uses nondominated sorting for model management, thereby avoiding combining the approximated fitness and the approximation uncertainty into a scalar function, which is shown to be particularly important for high-dimensional problems, where the estimated uncertainty becomes less reliable. Empirical studies on 50-D and 100-D benchmark problems and a synthetic problem constructed from four real-world optimization problems demonstrate that the proposed MIC is more effective than existing scalar infill criteria for GP-assisted optimization given a limited computational budget.
引用
收藏
页码:459 / 472
页数:14
相关论文
共 67 条
  • [1] [Anonymous], 1999, INTERPOLATION SPATIA
  • [2] [Anonymous], 1996, PRIORS INFINITE NETW
  • [3] Ben-Ari Einat Neumann, 2007, Quality Engineering, V19, P327, DOI 10.1080/08982110701580930
  • [4] Branke J, 2005, SOFT COMPUT, V9, P13, DOI [10.1007/s00500-003-0329-4, 10.1007/S00500-003-0329-4]
  • [5] A social learning particle swarm optimization algorithm for scalable optimization
    Cheng, Ran
    Jin, Yaochu
    [J]. INFORMATION SCIENCES, 2015, 291 : 43 - 60
  • [6] A Surrogate-Assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-Objective Optimization
    Chugh, Tinkle
    Jin, Yaochu
    Miettinen, Kaisa
    Hakanen, Jussi
    Sindhya, Karthik
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (01) : 129 - 142
  • [7] A data-driven surrogate-assisted evolutionary algorithm applied to a many-objective blast furnace optimization problem
    Chugh, Tinkle
    Chakraborti, Nirupam
    Sindhya, Karthik
    Jin, Yaochu
    [J]. MATERIALS AND MANUFACTURING PROCESSES, 2017, 32 (10) : 1172 - 1178
  • [8] 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
  • [9] Particle swarm optimization: Basic concepts, variants and applications in power systems
    del Valle, Yamille
    Venayagamoorthy, Ganesh Kumar
    Mohagheghi, Salman
    Hernandez, Jean-Carlos
    Harley, Ronald G.
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2008, 12 (02) : 171 - 195
  • [10] QUASI-NEWTON METHODS, MOTIVATION AND THEORY
    DENNIS, JE
    MORE, JJ
    [J]. SIAM REVIEW, 1977, 19 (01) : 46 - 89