首页> 外文会议>ASME International Design Engineering Technical Conferences >A NEW SEQUENTIAL MULTI-DISCIPLINARY OPTIMIZATION METHOD FOR BI-LEVEL DECOMPOSED SYSTEMS
【24h】

A NEW SEQUENTIAL MULTI-DISCIPLINARY OPTIMIZATION METHOD FOR BI-LEVEL DECOMPOSED SYSTEMS

机译:一种新的双级分解系统的序贯多学科优化方法

获取原文

摘要

Multi-discipline optimization (MDO) has been proposed to handle complex optimization problems with multiple disciplines or subsystems. These problems are with global and coupling variables that are shared by more than one subsystem, which is one of the major challenges for these problems. Diverse methods that can be classified as of single- and multi-levels have been developed aiming to solve those problems. Most of these methods do not give optimization autonomies to each subsystem concerning these shared variables. This study proposed that for decomposed bi-level MDO problems, each subsystem is given full optimization autonomy in the initial stage to decide possible best solutions individually. Then all the obtained solutions are given to the system that will process the information and dispatch shared variables to each subsystem. Based on these dispatched variables, subsystems will sequentially perform the corresponding optimization with respect to their local (and global) variables with additional consistency constraints. There is no nested optimization between the system and subsystems. Six numerical and engineering examples are tested and comparisons with other methods are made to demonstrate the efficiency and applicability of the proposed approach.
机译:已经提出了多学科优化(MDO)以处理多个学科或子系统的复杂优化问题。这些问题是由多个子系统共享的全局和耦合变量,这是这些问题的主要挑战之一。已经开发出可归类为单一和多层次的不同方法,旨在解决这些问题。这些方法中的大多数都不会向每个有关这些共享变量的子系统提供优化自主神经系统。本研究提出,对于分解的双级MDO问题,每个子系统都在初始阶段提供完全优化自治,以单独决定可能的最佳解决方案。然后,所有所获得的解决方案都给系统处理每个子系统的信息和调度共享变量。基于这些调度变量,子系统将顺序地对其本地(和全局)变量的相应优化具有额外的一致性约束。系统和子系统之间没有嵌套优化。测试六种数值和工程实例,并进行了与其他方法的比较,以证明所提出的方法的效率和适用性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号