首页> 外文期刊>Applied Soft Computing >Hybrid surrogate-based optimization using space reduction (HSOSR) for expensive black-box functions
【24h】

Hybrid surrogate-based optimization using space reduction (HSOSR) for expensive black-box functions

机译:基于混合的基于代理的优化,使用空间减少(HSOSR)用于昂贵的黑盒功能

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

In this paper, a surrogate-based global optimization algorithm HSOSR is presented, which can solve expensive black-box optimization problems with box constraints. In order to decrease difficulty of the search in large-scale multimodal problems, a space reduction method based on hybrid surrogates is proposed. Kriging and Radial Basis Function (RBF) are employed to approximate the true expensive problems, respectively. A large number of samples are generated by Latin hypercube sampling to obtain the predictive values from the two surrogates. According to the size of these predictive values from kriging and RBF, all the samples are sorted, respectively. Subsequently, two potentially better regions from kriging and RBF are identified based on the ranks of these samples and two subspaces are also created. Since kriging and RBF models always produce multiple predictive optimal solutions, a multi-start optimization algorithm is proposed to capture the supplementary samples in the two subspaces alternately. Besides, the newly added samples need to satisfy a defined distance criterion for sampling diversity. Once the algorithm gets stuck in a local valley, the estimated mean square error of kriging is maximized by the multi-start optimization strategy to explore the sparsely sampled area. Eventually, 10 low-dimensional and 5 high-dimensional benchmark cases are used to test HSOSR. In addition, 5 surrogate-based global optimization algorithms are also tested as contrast. Compared with the well-known efficient global optimization (EGO) method, HSOSR achieves an improvement of more than 50% on computational efficiency. To sum up, HSOSR has the high efficiency and strong robustness in dealing with multimodal expensive black-box optimization problems. (C) 2018 Elsevier B.V. All rights reserved.
机译:本文提出了一种基于代理的全局优化算法HSOSR,可以解决箱子约束的昂贵的黑盒优化问题。为了减少在大规模多模式问题中搜索的难度,提出了一种基于混合式代理的空间减少方法。 Kriging和径向基函数(RBF)用于分别近似真正的昂贵问题。由拉丁超立方体采样产生大量样本,以获得来自两个代理的预测值。根据Kriging和RBF的这些预测值的大小,分别对所有样品进行分类。随后,基于这些样本的等级来识别来自Kriging和RBF的两个可能更好的区域,并且还创建了两个子空间。由于Kriging和RBF模型始终产生多个预测性最佳解决方案,因此提出了一种多开始优化算法以交替捕获两个子空间中的补充样本。此外,新添加的样本需要满足用于采样分集的限定距离标准。一旦算法卡在当地谷中,克里格的估计均方误差由多开始优化策略最大化,以探索稀疏的采样区域。最终,10个低维和5个高维基准案例用于测试HSOSR。此外,还测试了5个基于代理的全局优化算法。与众所周知的高效全局优化(EGO)方法相比,HSOSR在计算效率上实现了50%以上的提高。总而言之,HSOSR具有高效率和强大的鲁棒性,可在处理多模式昂贵的黑匣子优化问题方面。 (c)2018 Elsevier B.v.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号