Research Papers

A Decomposition Method for Exploiting Parallel Computing Including the Determination of an Optimal Number of Subsystems

[+] Author and Article Information
Sangjin Jung

Senior Research Engineer
Production Engineering Research Institute,
LG Electronics, Inc.,
19-1, Cheongho-ri, Jinwi-myeon, Pyeongtaek-si,
Gyeonggi-do 451-713, Republic of Korea

Gyu-Byung Park

Ph.D. Candidate
Graduate School of Mechanical Engineering,
Hanyang University,
17 Haengdang-dong,
Seongdong-gu, Seoul 133-791, Republic of Korea

Dong-Hoon Choi

Department of Mechanical Engineering,
Hanyang University,
17 Haengdang-dong,
Seongdong-gu, Seoul 133-791, Republic of Korea

Contributed by the Design Automation Committee of ASME for publication in the JOURNAL OF MECHANICAL DESIGN. Manuscript received February 8, 2012; final manuscript received January 15, 2013; published online March 26, 2013. Assoc. Editor: Olivier de Weck.

J. Mech. Des 135(4), 041005 (Mar 26, 2013) (9 pages) Paper No: MD-12-1099; doi: 10.1115/1.4023554 History: Received February 08, 2012; Revised January 15, 2013

Many practical design problems are multidisciplinary and typically involve the transfer of complex information between analysis modules. In solving such problems, the method for performing multidisciplinary analyses greatly affects the speed of the total design time. Thus, it is very important to group and order a multidisciplinary analysis (MDA) process so as to minimize the total computational time and cost by decomposing a large multidisciplinary problem into several subsystems and then processing them in parallel. This study proposes a decomposition method that exploits parallel computing, including the determination of an optimal number of subsystems by using a multi-objective optimization formulation and a messy genetic algorithm (GA) modified to handle discrete design variables. In the suggested method, an MDA process is decomposed and sequenced for simultaneously minimizing the feedback couplings within each subsystem, the total couplings between subsystems, the variation of computation times among subsystems, and the computation time of each subsystem. The proposed method is applied to the decomposition of an artificial complex system example and a multidisciplinary design problem of a rotorcraft with 17 analysis modules; promising results are presented using this proposed method.

Copyright © 2013 by ASME
Your Session has timed out. Please sign back in to continue.


Azarm, S., and Li, W.-C., 1988, “A Two-Level Decomposition Method for Design Optimization,” Eng. Optim., 13(3), pp. 211–224. [CrossRef]
Rogers, J. L., 1989, “DeMAID—A Design Manager's Aid for Intelligent Decomposition User's Guide,” NASA Technical Memorandum (101575).
Kusiak, A., and Larson, N., 1995, “Decomposition and Representation Methods in Mechanical Design,” Trans. ASME J. Mech. Des., 117(B), pp. 17–24. [CrossRef]
Michelena, N. F., and Papalambros, P. Y., 1995, “Optimal Model-Based Decomposition of Powertrain System Design,” Trans. ASME J. Mech. Des., 117(4), pp. 499–505. [CrossRef]
Altus, S. S., Kroo, I. M., and Gage, P. J., 1996, “A Genetic Algorithm for Scheduling and Decomposition of Multidisciplinary Design Problems,” Trans. ASME J. Mech. Des., 118(4), pp. 486–489. [CrossRef]
English, K., Bloebaum, C. L., and Miller, E., 2001, “Development of Multiple Cycle Coupling Suspension in the Optimization of Complex Systems,” Struct. Multidiscip. Optim., 22(4), pp. 268–283. [CrossRef]
Park, H. W., Kim, M. S., and Choi, D. H., 2002, “A New Decomposition Method for Parallel Processing Multi-Level Optimization,” KSME Int. J., 16(5), pp. 609–618. [CrossRef]
Allison, J. T., Kokkolaras, M., and Papalambros, P. Y., 2009, “Optimal Partitioning and Coordination Decisions in Decomposition-Based Design Optimization,” Trans. ASME J. Mech. Des., 131(8), p. 0810081. [CrossRef]
Shan, S. Q., and Wang, G. G., 2010, “Survey of Modeling and Optimization Strategies to Solve High-Dimensional Design Problems With Computationally-Expensive Black-Box Functions,” Struct. Multidiscip. Optim., 41(2), pp. 219–241. [CrossRef]
Li, S., 2009, “Matrix-Based Decomposition Algorithms for Engineering Applications: The Survey And Generic Framework,” Int. J. Prod. Dev., 9(1-3), pp. 78–110. [CrossRef]
Steward, D., 1981, Systems Analysis and Management: Structure, Strategy, and Design, Petrocelli Books, New York, NY.
Browning, T. R., 2001, “Applying the Design Structure Matrix to System Decomposition and Integration Problems: A Review and New Directions,” IEEE Trans. Eng. Manage., 48(3), pp. 292–306. [CrossRef]
Yassine, A., and Braha, D., 2003, “Complex Concurrent Engineering and the Design Structure Matrix Method,” Concurr. Eng. Res. Appl., 11(3), pp. 165–176. [CrossRef]
Chen, L., Ding, Z., and Li, S., 2005, “A Formal Two-Phase Method for Decomposition of Complex Design Problems,” Trans. ASME J. Mech. Des., 127(2), pp. 184–195. [CrossRef]
Rogers, J. L., 1997, “Reducing Design Cycle Time and Cost Through Process Resequencing,” International Conference on Engineering Design, Tampere.
Krishnamachari, R. S., and Papalambros, P. Y., 1997, “Hierarchical Decomposition Synthesis in Optimal Systems Design,” Trans. ASME J. Mech. Des., 119(4), pp. 448–455. [CrossRef]
Chen, D. Z., and Liu, C. P., 1999, “A Hierarchical Decomposition Scheme for the Topological Synthesis of Articulated Gear Mechanisms,” Trans. ASME J. Mech. Des., 121(2), pp. 256–263. [CrossRef]
Sobieszczanski-Sobieski, J., and Haftka, R. T., 1997, “Multidisciplinary Aerospace Design Optimization: Survey of Recent Developments,” Struct. Multidiscip. Optim., 14(1), pp. 1–23. [CrossRef]
Cramer, E. J., Dennis, J. J. E., Frank, P. D., Lewis, R. M., and Shubin, G. R., 1994, “Problem Formulation for Multidisciplinary Optimization,” SIAM J. Optim., 4(4), pp. 754–776. [CrossRef]
Braun, R. D., 1996, “Collaborative Optimization: An Architecture for Large-Scale Distributed Design,” Ph.D. thesis, Stanford University, Stanford, CA.
Sobieszczanski-Sobieski, J., Agte, J. S., and Sandusky, Jr., R. R., 2000, “Bilevel Integrated System Synthesis,” AIAA J., 38(1), pp. 164–172. [CrossRef]
Kodiyalam, S., and Sobieszczanski-Sobieski, J., 2000, “Bilevel Integrated System Synthesis With Response Surfaces,” AIAA J., 38(8), pp. 1479–1485. [CrossRef]
Sobieszczanski-Sobieski, J., and Kodiyalam, S., 2001, “BLISS/S: A New Method for Two-Level Structural Optimization,” Struct. Multidiscip. Optim., 21(1), pp. 1–13. [CrossRef]
Sobieszczanski-Sobieski, J., Altus, T. D., Phillips, M., and Sandusky, R., 2003, “Bilevel Integrated System Synthesis for Concurrent and Distributed Processing,” AIAA J., 41(10), pp. 1996–2003. [CrossRef]
Kim, H. M., Rideout, D. G., Papalambros, P. Y., and Stein, J. L., 2003, “Analytical Target Cascading in Automotive Vehicle Design,” Trans. ASME J. Mech. Des., 125(3), pp. 481–489. [CrossRef]
Park, H. W., Lee, S. J., Lee, H. S., and Choi, D. H., 2004, “Adaptive Parallel Decomposition for Multidisciplinary Design,” KSME Int. J., 18(5), pp. 814–819.
Rogers, J. L., 1996, “DeMAID/GA User's Guide Design Manager's Aid for Intelligent Decomposition With a Genetic Algorithm,” NASA Technical Memorandum (110241).
Goldberg, D., Deb, K., and Korb, B., 1989, “Messy Genetic Algorithms: Motivation, Analysis, and First Results,” Complex Syst.3(5), pp. 493–530.
Kim, I. Y., and de Weck, O. L., 2005, “Variable Chromosome Length Genetic Algorithm for Progressive Refinement in Topology Optimization,” Struct. Multidiscip. Optim., 29, pp. 445–456. [CrossRef]
Brie, A. H., and Morignot, P., 2005, “Genetic Planning Using Variable Length Chromosomes,” Proceedings of the 15th International Conference on Automated Planning and Scheduling , AAAI Press, Monterey, CA.
Eppinger, S. D., Whitney, D. E., and Gebala, D. A., 1992, “Organizing the Tasks in Complex Design Projects: Development of Tools to Represent Design Procedures,” NSF Design and Manufacturing Systems Conference, Atlanta, Georgia.
Miettinen, K., 1999, Nonlinear Multiobjective Optimization, Kluwer Academic Publishers, Boston, MA.
Bäck, T., 1996, Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms, Oxford University Press, New York, NY.
Gen, M., and Cheng, R., 1997, Genetic Algorithms and Engineering Design, Wiley, New York, NY.


Grahic Jump Location
Fig. 1

MDA process represented by using DSM

Grahic Jump Location
Fig. 2

Analysis time and coupling strength values within the DSM

Grahic Jump Location
Fig. 3

Variables defined for decomposition in DSM

Grahic Jump Location
Fig. 4

Dividing points between subsystems in the DSM

Grahic Jump Location
Fig. 5

Extended chromosome

Grahic Jump Location
Fig. 6

A suggested crossover method

Grahic Jump Location
Fig. 7

A suggested mutation method

Grahic Jump Location
Fig. 8

Flow chart of the proposed decomposition method

Grahic Jump Location
Fig. 9

Initial DSM of example 1

Grahic Jump Location
Fig. 10

Decomposed DSM for case 1

Grahic Jump Location
Fig. 11

The trend of optimal values for the function F according to changing the fixed number of subsystems

Grahic Jump Location
Fig. 12

Data flow of the rotorcraft analysis process

Grahic Jump Location
Fig. 13

Initial DSM of the rotorcraft analysis process

Grahic Jump Location
Fig. 14

Decomposed DSM for case 1

Grahic Jump Location
Fig. 15

Convergence history of the proposed GA in case 1

Grahic Jump Location
Fig. 16

Decomposed DSM for case 8

Grahic Jump Location
Fig. 17

Comparison between the decomposed DSM in Ref. [26] and the DSM decomposed by the proposed method



Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In