首页> 外文期刊>Engineering with Computers >Data driven surrogate-based optimization in the problem solving environment WBCSim
【24h】

Data driven surrogate-based optimization in the problem solving environment WBCSim

机译:问题解决环境WBCSim中基于数据驱动的基于代理的优化

获取原文
获取原文并翻译 | 示例
           

摘要

Large scale, multidisciplinary, engineering designs are always difficult due to the complexity and dimensionality of these problems. Direct coupling between the analysis codes and the optimization routines can be prohibitively time consuming due to the complexity of the underlying simulation codes. One way of tackling this problem is by constructing computationally cheap(er) approximations of the expensive simulations that mimic the behavior of the simulation model as closely as possible. This paper presents a data driven, surrogate-based optimization algorithm that uses a trust region-based sequential approximate optimization (SAO) framework and a statistical sampling approach based on design of experiment (DOE) arrays. The algorithm is implemented using techniques from two packages-SURFPACK and SHEPPACK that provide a collection of approximation algorithms to build the surrogates and three different DOE techniques- full factorial (FF), Latin hypercube sampling, and central composite design-are used to train the surrogates. The results are compared with the optimization results obtained by directly coupling an optimizer with the simulation code. The biggest concern in using the SAO framework based on statistical sampling is the generation of the required database. As the number of design variables grows, the computational cost of generating the required database grows rapidly. A data driven approach is proposed to tackle this situation, where the trick is to run the expensive simulation if and only if a nearby data point does not exist in the cumulatively growing database. Over time the database matures and is enriched as more and more optimizations are performed. Results show that the proposed methodology dramatically reduces the total number of calls to the expensive simulation runs during the optimization process.
机译:由于这些问题的复杂性和规模性,大规模,多学科的工程设计始终是困难的。由于底层仿真代码的复杂性,分析代码与优化例程之间的直接耦合可能会非常耗时。解决此问题的一种方法是通过构建昂贵模拟的计算便宜(近似)近似值来尽可能模拟模拟模型的行为。本文提出了一种基于数据驱动,基于代理的优化算法,该算法使用基于信任区域的顺序近似优化(SAO)框架和基于实验(DOE)阵列设计的统计采样方法。该算法是使用两个软件包SURFPACK和SHEPPACK来实现的,这两个软件包提供了一组近似算法来构建代理,并且使用了三种不同的DOE技术(全因子(FF),拉丁超立方体采样和中央复合设计)来训练该算法。代孕。将结果与通过直接将优化器与仿真代码耦合而获得的优化结果进行比较。使用基于统计抽样的SAO框架时,最大的顾虑是所需数据库的生成。随着设计变量数量的增加,生成所需数据库的计算成本迅速增加。提出了一种数据驱动的方法来解决这种情况,其中的诀窍是,当且仅当累积增长的数据库中不存在附近的数据点时,才运行昂贵的模拟。随着时间的推移,随着执行越来越多的优化,数据库会日趋成熟和丰富。结果表明,所提出的方法极大地减少了优化过程中对昂贵的仿真运行的调用总数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号