A multi-point sampling method based on kriging for global optimization

被引:29
作者
Cai, Xiwen [1 ]
Qiu, Haobo [1 ]
Gao, Liang [1 ]
Yang, Peng [1 ]
Shao, Xinyu [1 ]
机构
[1] Huazhong Univ Sci & Technol, State Key Lab Digital Mfg Equipment & Technol, Wuhan 430074, Peoples R China
基金
中国国家自然科学基金;
关键词
Global optimization; Multi-point sampling; Kriging; Expected improvement function; Parallel computation; Design optimization; ALGORITHM; EXPLORATION; MODEL;
D O I
10.1007/s00158-017-1648-x
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In general, sampling strategy plays a very important role in metamodel based design optimization, especially when computationally expensive simulations are involved in the optimization process. The research on new optimization methods with less sampling points and higher convergence speed receives great attention in recent years. In this paper, a multi-point sampling method based on kriging (MPSK) is proposed for improving the efficiency of global optimization. The sampling strategy of this method is based on a probabilistic distribution function converted from the expected improvement (EI) function. It can intelligently draw appropriate new samples in an area with certain probability according to corresponding EI values. Besides, three strategies are also proposed to speed up the sequential sampling process and the corresponding convergence criterions are put forward to stop the searching process reasonably. In order to validate the efficiency of this method, it is tested by several numerical benchmark problems and applied in two engineering design optimization problems. Moreover, an overall comparison between the proposed method and several other typical global optimization methods has been made. Results show that the higher global optimization efficiency of this method makes it particularly suitable for design optimization problems involving computationally expensive simulations.
引用
收藏
页码:71 / 88
页数:18
相关论文
共 36 条
[1]  
[Anonymous], 13 AIAA ISSMO MULT A
[2]  
[Anonymous], 2012, 2012 IEEE POW EN SOC, DOI DOI 10.1021/ACS.ORGLETT.1C03110
[3]  
Arora J., 2004, INTRO OPTIMUM DESIGN
[4]   Efficient Global Optimization with Adaptive Target Setting [J].
Chaudhuri, Anirban ;
Haftka, Raphael T. .
AIAA JOURNAL, 2014, 52 (07) :1573-1577
[5]   Use of a self-adaptive penalty approach for engineering optimization problems [J].
Coello, CAC .
COMPUTERS IN INDUSTRY, 2000, 41 (02) :113-127
[6]  
Desautels T, 2014, J MACH LEARN RES, V15, P3873
[7]   Performance study of mode-pursuing sampling method [J].
Duan, X. ;
Wang, G. G. ;
Kang, X. ;
Niu, Q. ;
Naterer, G. ;
Peng, Q. .
ENGINEERING OPTIMIZATION, 2009, 41 (01) :1-21
[8]  
Finkel D., 2003, Direct optimization algorithm user guide, P2
[9]   A Random-Discretization Based Monte Carlo Sampling Method and its Applications [J].
James C. Fu ;
Liqun Wang .
Methodology And Computing In Applied Probability, 2002, 4 (1) :5-25
[10]  
Ginsbourger D, 2010, ADAPT LEARN OPTIM, V2, P131