A new decomposition method for parallel processing multi-level optimization

被引:4
作者
Park, HW [1 ]
Kim, MS [1 ]
Choi, DH [1 ]
机构
[1] Hanyang Univ, Ctr Innovat Design Optimizat Technol, Sungdong Gu, Seoul 133791, South Korea
来源
KSME INTERNATIONAL JOURNAL | 2002年 / 16卷 / 05期
关键词
parallel decomposition; multidisciplinary design optimization;
D O I
10.1007/BF03184810
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
In practical designs, most of the multidisciplinary problems have a large-size and complicate design system. Since multidisciplinary problems have hundreds of analyses and thousands of variables, the grouping of analyses and the order of the analyses in the group affect the speed of the total design cycle. Therefore, it is very important to reorder and regroup the original design processes in order to minimize the total computational cost by decomposing large multidisciplinary problems into several multidisciplinary analysis subsystems (MDASS) and by processing them in parallel. In this study, a new decomposition method is proposed for parallel processing of multidisciplinary design optimization, such as collaborative optimization (CO) and individual discipline feasible (IDF) method. Numerical results for two example problems are presented to show the feasibility of the proposed method.
引用
收藏
页码:609 / 618
页数:10
相关论文
共 19 条
[1]  
ALTUS SS, 1995, 95141 ASME
[2]  
[Anonymous], 1995, Mathematical Methods in Statistics
[3]  
COLVILLE AR, 3202949 IBN, P32
[4]  
ESCHENAUER HA, 1999, ADV DESIGN AUTOMATIO, V1, P24
[5]  
KROO I, 1994, 944325 AIAA, P697
[6]  
KROO I, 1994, AIAA944325CP, P697
[7]  
MCCULLEY CM, 1994, 5 AIAA USAF NASA OAI
[8]  
MITSUO G, 1997, GENETIC ALGORITHMS E, P1
[9]  
ROGERS JL, 1992, 924809 AIAA
[10]  
ROGERS JL, 1996, 964175 AIAA