首页> 外文会议>AIAA aerospace sciences meeting including the new horizons forum and aerospace exposition >Multi-Fidelity Optimization Strategies using Genetic Algorithms and Sequential Kriging Surrogates
【24h】

Multi-Fidelity Optimization Strategies using Genetic Algorithms and Sequential Kriging Surrogates

机译:使用遗传算法和顺序克里格代理的多保真优化策略

获取原文

摘要

Many engineering problems use high-fidelity simulations for analysis; these simulations may have long runtimes and may have inherent discontinuities. Engineering design problems may also involve discrete variables. Population-based methods, such as the genetic algorithm, can perform design optimization for these kinds of problems. In spite of its advantages in handling discontinuities in the functions and/or variables, a notable disadvantage of using such optimization methods is the large number of function evaluations (cost) associated with them. This study approaches the issue by formulating and implementing two multi-fidelity optimization strategies that use a genetic algorithm framework in which sequentially-updated Kriging surrogates provide low-fidelity function evaluations to reduce the computation time for the optimal search. Space-filling sampling methods help to obtain good design space coverage for the initial Kriging models. The two multi-fidelity strategies are compared to the binary-coded genetic algorithm on a number of analytic test functions and engineering problems, including an aircraft-sizing problem. Results showcase how the two strategies perform as well as the binary-coded genetic algorithm in finding solutions at a fraction of the computational cost.
机译:许多工程问题都使用高保真模拟进行分析。这些模拟可能需要较长的运行时间,并且可能具有固有的不连续性。工程设计问题也可能涉及离散变量。基于群体的方法(例如遗传算法)可以对这些类型的问题执行设计优化。尽管在处理函数和/或变量的不连续性方面具有优势,但使用此类优化方法的显着缺点是与它们相关的大量函数评估(成本)。本研究通过使用遗传算法框架制定和实现两种多保真度优化策略来解决该问题,在遗传算法框架中,按顺序更新的Kriging替代物可提供低保真度函数评估,以减少最佳搜索的计算时间。空间填充采样方法有助于为初始Kriging模型获得良好的设计空间覆盖率。在许多分析测试功能和工程问题(包括飞机尺寸问题)上,将两种多保真策略与二进制编码的遗传算法进行了比较。结果展示了这两种策略的性能以及二进制编码的遗传算法在以较低的计算成本找到解决方案的过程中的表现。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号