A complete expected improvement criterion for Gaussian process assisted highly constrained expensive optimization

被引:66
作者
Jiao, Ruwang [1 ]
Zeng, Sanyou [1 ]
Li, Changhe [2 ,3 ]
Jiang, Yuhong [4 ]
Jin, Yaochu [5 ]
机构
[1] China Univ Geosci, Sch Mech Engn & Elect Informat, Wuhan 430074, Hubei, Peoples R China
[2] China Univ Geosci, Sch Automat, Wuhan 430074, Hubei, Peoples R China
[3] China Univ Geosci, Hubei Key Lab Adv Control & Intelligent Automat C, Wuhan 430074, Hubei, Peoples R China
[4] China Univ Geosci, Sch Comp Sci, Wuhan 430074, Hubei, Peoples R China
[5] Univ Surrey, Dept Comp Sci, Guildford GU27XH, Surrey, England
基金
中国国家自然科学基金;
关键词
Evolutionary computation; Expensive optimization; Expected improvement; Constrained optimization; Gaussian process; SURROGATE MODEL; EVOLUTIONARY ALGORITHM; DIFFERENTIAL EVOLUTION; GLOBAL OPTIMIZATION;
D O I
10.1016/j.ins.2018.09.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Expected improvement (El) is a popular infill criterion in Gaussian process assisted optimization of expensive problems for determining which candidate solution is to be assessed using the expensive evaluation method. An El criterion for constrained expensive optimization (constrained El) has also been suggested, which requires that feasible solutions exist in the candidate solutions. However, the constrained El criterion will fail to work in case there are no feasible solutions. To address the above issue, this paper proposes a new El criterion for highly constrained optimization that can work properly even when no feasible solution is available in the current population. The proposed constrained El criterion can not only exploit local feasible regions, but also explore infeasible yet promising regions, making it a complete constrained El criterion. The complete constrained El is theoretically validated and empirically verified. Simulation results demonstrate that the proposed complete constrained El is better than or comparable to five existing infill criteria. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:80 / 96
页数:17
相关论文
共 49 条
[1]  
[Anonymous], 2003, QUAL ENG
[2]  
[Anonymous], COMPUTATIONAL INTELL
[3]  
[Anonymous], 2006, J APPL MECH
[4]  
[Anonymous], 2016, PROC IEEE S COMPUT I
[5]  
AUDET C, 2000, 8 S MULT AN OPT
[6]   An improved differential evolution algorithm using efficient adapted surrogate model for numerical optimization [J].
Awad, Noor H. ;
Ali, Mostafa Z. ;
Mallipeddi, Rammohan ;
Suganthan, Ponnuthurai N. .
INFORMATION SCIENCES, 2018, 451 :326-347
[7]   Constraint Handling in Efficient Global Optimization [J].
Bagheri, Samineh ;
Konen, Wolfgang ;
Allmendinger, Richard ;
Branke, Jurgen ;
Deb, Kalyanmoy ;
Fieldsend, Jonathan ;
Quagliarella, Domenico ;
Sindhya, Karthik .
PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'17), 2017, :673-680
[8]   Constrained efficient global optimization with support vector machines [J].
Basudhar, Anirban ;
Dribusch, Christoph ;
Lacaze, Sylvain ;
Missoum, Samy .
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2012, 46 (02) :201-221
[9]  
Bhattacharjee KS, 2016, IEEE C EVOL COMPUTAT, P4328, DOI 10.1109/CEC.2016.7744340
[10]   A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms [J].
Chugh, Tinkle ;
Sindhya, Karthik ;
Hakanen, Jussi ;
Miettinen, Kaisa .
SOFT COMPUTING, 2019, 23 (09) :3137-3166