首页> 外文学位 >Sequential approximation in nonhierarchic system decomposition and optimization: A multidisciplinary design tool.
【24h】

Sequential approximation in nonhierarchic system decomposition and optimization: A multidisciplinary design tool.

机译:非分层系统分解和优化中的顺序逼近:一种多学科设计工具。

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

摘要

This thesis demonstrates the utility of approximation in the optimization of non-hierarchic systems. Two variations of a multidisciplinary design optimization algorithm for optimizing non-hierarchic systems are developed and implemented in this thesis. A third variation is developed for future implementation studies. The algorithm provides for the optimization of non-hierarchic systems by decomposition into reduced design subspaces. The procedure utilizes approximating functions as a basis for the coordination of concurrent subspace design optimizations.; The algorithm imposes the same objective function and constraints at each subspace. Non-local analyses are approximated at the subspaces using global sensitivities. Local analyses are performed using the design tools (analyses packages) available to the subspace design team. The algorithm optimizes the nonlinear subspace problems concurrently allowing for parallel processing. Following each sequence of concurrent subspace optimizations an approximation to the global problem (i.e., the system) is formed using design data accumulated during the subspace optimizations. The solution of the global approximation problem is used as the starting point for subsequent subspace optimizations in an iterative solution procedure. The algorithm is sequential with move limits being imposed at the subspaces and in the coordination procedure to maintain the accuracy of approximations.; The algorithm accommodates existing design procedures where design teams operate concurrently. The algorithm's use of subspace optimization provides for individual design teams working concurrently. Information obtained during the subspace optimizations is used to build a design data base representative of design experience. The coordination procedure of global approximation, built from the design data base, accommodates design tradeoffs and provides robust algorithm coordination in implementation studies.; The use of approximating functions is seen to significantly reduce the number of system analyses required to optimize multidisciplinary design optimization problems. The algorithm effectively optimizes each problem in a test set of non-hierarchic system problems developed as part of this thesis.
机译:本文证明了近似在非分层系统优化中的效用。本文开发并实现了用于优化非分层系统的多学科设计优化算法的两个变体。为将来的实施研究开发了第三个变体。该算法通过分解为精简的设计子空间来优化非分层系统。该程序利用近似函数作为并发子空间设计优化协调的基础。该算法在每个子空间上施加相同的目标函数和约束。使用全局敏感性在子空间中对非局部分析进行了近似。使用子空间设计团队可用的设计工具(分析包)执行局部分析。该算法同时优化了非线性子空间问题,从而允许并行处理。在并发子空间优化的每个序列之后,使用在子空间优化期间累积的设计数据来形成对全局问题(即系统)的近似。全局逼近问题的解决方案在迭代求解过程中用作后续子空间优化的起点。该算法是连续的,在子空间和协调过程中施加了移动限制,以保持近似的准确性。该算法适用于现有的设计过程,其中设计团队可以同时进行操作。该算法对子空间优化的使用使各个设计团队可以同时工作。在子空间优化过程中获得的信息用于构建代表设计经验的设计数据库。从设计数据库建立的全局逼近协调程序可以适应设计的折衷,并在实施研究中提供可靠的算法协调。可以看出,使用近似函数可以显着减少优化多学科设计优化问题所需的系统分析次数。该算法有效地优化了作为本文一部分而开发的非分层系统问题的测试集中的每个问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号