当前位置: X-MOL 学术Swarm Evol. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A novel surrogate-assisted evolutionary algorithm with an uncertainty grouping based infill criterion
Swarm and Evolutionary Computation ( IF 10 ) Pub Date : 2020-10-12 , DOI: 10.1016/j.swevo.2020.100787
Qunfeng Liu , Xunfeng Wu , Qiuzhen Lin , Junkai Ji , Ka-Chun Wong

For tackling expensive optimization problems (EOPs), surrogate-assisted evolutionary algorithms (SAEAs) will run the evolutionary search and then select some promising solutions to be evaluated as predicted by the surrogate models. Different model management criteria for the surrogate models, such as improvement probability, expected improvement, and lower confidence bound, have shown their effectiveness when solving EOPs. In this paper, a novel SAEA with an uncertainty grouping based infill criterion, called SAEA-UGC, is proposed, in which the uncertainty is treated as an indicator to select solutions for training the models. The selected solutions are adopted to train an ensemble surrogate model and a radial basis function model, which run the global search and local search respectively. After obtaining the predicted value and uncertainty for all solutions in global search, they are evenly grouped according to uncertainty and a best predicted solution from each group is selected to form a new population. The global search and local search are cooperative to find the optimal value for the target EOP, i.e., global search or local search will continually run if an improved value for the target EOP can be found in each iteration; otherwise, the switch between global search and local search will happen. The performance of SAEA-UGC is validated when tacking 20 widely used test problems with various properties. The experimental results confirm the superiority of SAEA-UGC over four representative SAEAs in solving a majority of test EOPs.



中文翻译:

基于不确定性分组的填充准则的新型代理辅助进化算法

为了解决昂贵的优化问题(EOP),代理辅助进化算法(SAEA)将运行进化搜索,然后选择一些有希望的解决方案,以按照代理模型的预测进行评估。替代模型的不同模型管理标准,例如改进概率,预期改进和较低置信区间,已显示出它们在解决EOP时的有效性。在本文中,提出了一种新的基于不确定性分组的SAEA标准,称为SAEA-UGC,其中将不确定性作为选择训练模型的解决方案的指标。选取的解决方案被用来训练整体代理模型和径向基函数模型,分别运行全局搜索和局部搜索。在获得全局搜索中所有解决方案的预测值和不确定性后,根据不确定性将它们平均分组,并从每组中选择最佳预测解决方案以形成新的总体。全局搜索和局部搜索协作以找到目标EOP的最佳值,即,如果可以在每次迭代中找到目标EOP的改进值,则全局搜索或局部搜索将连续运行。否则,将在全局搜索和本地搜索之间进行切换。解决20种具有各种特性的广泛使用的测试问题时,可以验证SAEA-UGC的性能。实验结果证实了SAEA-UGC在解决大多数测试EOP方面优于四个代表性SAEA。根据不确定性将它们平均分组,并从每组中选择最佳预测解决方案以形成新的总体。全局搜索和局部搜索协作以找到目标EOP的最佳值,即,如果可以在每次迭代中找到目标EOP的改进值,则全局搜索或局部搜索将连续运行。否则,将在全局搜索和本地搜索之间进行切换。解决20种具有各种特性的广泛使用的测试问题时,可以验证SAEA-UGC的性能。实验结果证实了SAEA-UGC在解决大多数测试EOP方面优于四个代表性SAEA。根据不确定性将它们平均分组,并从每组中选择最佳预测解决方案以形成新的总体。全局搜索和局部搜索协作以找到目标EOP的最佳值,即,如果可以在每次迭代中找到目标EOP的改进值,则全局搜索或局部搜索将连续运行。否则,将发生全局搜索和本地搜索之间的切换。解决20种具有各种特性的广泛使用的测试问题时,可以验证SAEA-UGC的性能。实验结果证实了SAEA-UGC在解决大多数测试EOP方面优于四个代表性SAEA。如果可以在每次迭代中找到目标EOP的改进值,则全局搜索或局部搜索将继续运行;否则,将发生全局搜索和本地搜索之间的切换。解决20种具有各种特性的广泛使用的测试问题时,可以验证SAEA-UGC的性能。实验结果证实了SAEA-UGC在解决大多数测试EOP方面优于四个代表性SAEA。如果可以在每次迭代中找到目标EOP的改进值,则全局搜索或局部搜索将继续运行;否则,将发生全局搜索和本地搜索之间的切换。解决20种具有各种特性的广泛使用的测试问题时,可以验证SAEA-UGC的性能。实验结果证实了SAEA-UGC在解决大多数测试EOP方面优于四个代表性SAEA。

更新日期:2020-10-30
down
wechat
bug