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

Abstract

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.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 7 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.