Liu Zhening, Wang Handing, Jin Yaochu
IEEE Trans Cybern. 2023 Oct;53(10):6263-6276. doi: 10.1109/TCYB.2022.3170344. Epub 2023 Sep 15.
A number of real-world multiobjective optimization problems (MOPs) are driven by the data from experiments or computational simulations. In some cases, no new data can be sampled during the optimization process and only a certain amount of data can be sampled before optimization starts. Such problems are known as offline data-driven MOPs. Although multiple surrogate models approximating each objective function are able to replace the real fitness evaluations in evolutionary algorithms (EAs), their approximation errors are easily accumulated and therefore, mislead the solution ranking. To mitigate this issue, a new surrogate-assisted indicator-based EA for solving offline data-driven multiobjective problems is proposed. The proposed algorithm adopts an indicator-based selection EA as the baseline optimizer due to its selection robustness to the approximation errors of surrogate models. Both the Kriging models and radial basis function networks (RBFNs) are employed as surrogate models. An adaptive model selection mechanism is designed to choose the right type of models according to a maximum acceptable approximation error that is less likely to mislead the indicator-based search. The main idea is that when the uncertainty of the Kriging models exceeds the acceptable error, the proposed algorithm selects RBFNs as the surrogate models. The results comparing with state-of-the-art algorithms on benchmark problems with up to ten objectives indicate that the proposed algorithm is effective on offline data-driven optimization problems with up to 20 and 30 decision variables.
许多实际的多目标优化问题(MOP)是由实验或计算模拟的数据驱动的。在某些情况下,优化过程中无法采样新的数据,并且在优化开始之前只能采样一定量的数据。这类问题被称为离线数据驱动的MOP。尽管多个逼近每个目标函数的代理模型能够在进化算法(EA)中替代实际的适应度评估,但其逼近误差很容易累积,从而误导解的排序。为缓解这一问题,提出了一种用于求解离线数据驱动多目标问题的基于代理辅助指标的EA。由于其对代理模型逼近误差的选择鲁棒性,所提出的算法采用基于指标的选择EA作为基线优化器。克里金模型和径向基函数网络(RBFN)都被用作代理模型。设计了一种自适应模型选择机制,根据不太可能误导基于指标搜索的最大可接受逼近误差来选择合适的模型类型。主要思想是,当克里金模型的不确定性超过可接受误差时,所提出的算法选择RBFN作为代理模型。在具有多达十个目标的基准问题上与现有算法的比较结果表明,所提出的算法对于具有多达20个和30个决策变量的离线数据驱动优化问题是有效的。