A Surrogate-Assisted Evolutionary Framework With Regions of Interests-Based Data Selection for Expensive Constrained Optimization
针对目标函数和约束函数代理模型感兴趣区域不同的问题，提出分别用不同训练数据构建代理模型的通用框架，并设计新的填充采样准则和搜索强度调整策略，在多个基准问题上验证了有效性。
Optimization problems whose evaluations of the objective and constraints involve costly numerical simulations or physical experiments are referred to as expensive constrained optimization (ECO) problems. Such problems can be solved by evolutionary algorithms (EAs) in conjunction with computationally cheap surrogates that separately approximate the expensive objective and constraint functions. During the process of the ECO, the interested regions of surrogate models for the objective and constraints usually have a small overlap only. Specifically, the surrogate model for the objective function should focus on the prediction accuracy in the promising region, while the models for constraint functions should concentrate on the accuracy at the boundary of the feasible region. However, most existing methods neglect such differences and train those different models using the same training data, barely resulting in satisfactory performance. Therefore, we propose a general framework for solving expensive optimization problems with inequality constraints. In the proposed framework, the objective and constraints are separately trained with two different sets of training data to enhance the prediction accuracy and reliability in the interested regions. A novel infill sampling criterion is tailored to decide whether potentially better or more uncertain solutions should be sampled. Moreover, a new strategy, termed search intensity adjustment, is designed for adjusting the number of search generations on new surrogate models. We attempt to embed three competitive constrained EAs into our framework to verify its generality. The experimental results obtained on numerous benchmark functions from CEC2006, CEC2010, and CEC2017 have demonstrated the superiority of our approach over three state-of-the-art surrogate-assisted EAs.