Surrogate-based optimization with clustering-based space exploration for expensive multimodal problems

被引:27
作者
Dong, Huachao [1 ,2 ]
Song, Baowei [1 ]
Wang, Peng [1 ]
Dong, Zuomin [2 ]
机构
[1] Northwestern Polytech Univ, Sch Marine Sci & Technol, Xian 710072, Shaanxi, Peoples R China
[2] Univ Victoria, Dept Mech Engn, Victoria, BC, Canada
基金
中国国家自然科学基金; 加拿大自然科学与工程研究理事会;
关键词
Kriging model; Quadratic response surface; Clustering-based space exploration; Multimodal problems; Nonlinear constrained optimization; EFFICIENT GLOBAL OPTIMIZATION; DESIGN; ALGORITHM; FRAMEWORK;
D O I
10.1007/s00158-017-1826-x
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper presents a surrogate-based global optimization algorithm to solve multimodal expensive black-box optimization problems (EBOPs) with or without expensive nonlinear constraints. Two approximation methods (kriging and quadratic response surfaces, QRS) are used to construct surrogate models, among which kriging can predict multiple promising local optima and QRS can reflect the overall trend of a true model. According to their characteristics, two different optimizers are employed to capture the promising samples on kriging and QRS, respectively. One is the nature-inspired algorithm "Grey wolf optimization (GWO)", which can efficiently find the global optimum of a QRS model. The other one is a multi-start optimization algorithm that can find several different local optimal locations from a kriging model. In addition, the complete optimization flow is presented and its detailed pseudo code is given. In the presented optimization flow, if a proposed local convergence criterion is satisfied, sparsely sampled regions will be explored. Such a space exploration strategy is developed based on the k-means clustering algorithm, which can make search jump out of a local optimal location and focus on unexplored regions. Furthermore, two penalty functions are proposed to make this algorithm applicable for constrained optimization. With tests on 15 bound constrained and 7 nonlinear constrained benchmark examples, the presented algorithm shows remarkable capacity in dealing with multimodal EBOPs and constrained EBOPs.
引用
收藏
页码:1553 / 1577
页数:25
相关论文
共 39 条
[1]   A trust-region framework for managing the use of approximation models in optimization [J].
Alexandrov, NM ;
Dennis, JE ;
Lewis, RM ;
Torczon, V .
STRUCTURAL OPTIMIZATION, 1998, 15 (01) :16-23
[2]  
[Anonymous], 2011, 8 INT C EL ENG COMP
[3]  
[Anonymous], J GLOBAL OPTIMIZATIO
[4]   A genetic algorithm for the set covering problem [J].
Beasley, JE ;
Chu, PC .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) :392-404
[5]  
Boggs P.T., 1995, ACTA NUMER, V4, P1, DOI [DOI 10.1017/S0962492900002518, 10.1017/s0962492900002518]
[6]   Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art [J].
Coello, CAC .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2002, 191 (11-12) :1245-1287
[7]   Mining constraint relationships and redundancies with association analysis for optimization problem formulation [J].
Cutbill, Adam ;
Wang, G. Gary .
ENGINEERING OPTIMIZATION, 2016, 48 (01) :115-134
[8]   Multidisciplinary dynamic optimization of horizontal axis wind turbine design [J].
Deshmukh, Anand P. ;
Allison, James T. .
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2016, 53 (01) :15-27
[9]  
Díaz-Manríquez A, 2011, IEEE C EVOL COMPUTAT, P2155
[10]   Hybrid and adaptive meta-model-based global optimization [J].
Gu, J. ;
Li, G. Y. ;
Dong, Z. .
ENGINEERING OPTIMIZATION, 2012, 44 (01) :87-104