The two-phase method is a matrix-based approach for system decomposition, in which a system is represented by a rectangular matrix to capture dependency relationships of two sets of system elements. While the two-phase method has its own advantages in problem decomposition, this paper focuses on two methodical extensions to improve the method’s capability. The first extension is termed nonbinary dependency analysis, which can handle nonbinary dependency information, in addition to just binary information, of the model. This extension is based on the formal analysis of a resemblance coefficient to quantify the couplings among the model’s elements. The second extension is termed heuristic partitioning analysis, which allows the method to search for a reasonably good decomposition solution with less computing effort. This extension can be viewed as an alternative to the original partitioning approach that uses an enumerative approach to search for an optimal solution. At the end, the relief valve redesign example is applied to illustrate and justify the newly developed method components.

1.
Wagner
,
T. C.
, and
Papalambros
,
P. Y.
, 1993, “
A General Framework for Decomposition Analysis in Optimal Design
,”
Advances in Design Automation
,
B. J.
Gilmore
, ed.,
ASME
,
New York
, pp.
315
325
.
2.
Chen
,
L.
,
Ding
,
Z.
, and
Li
,
S.
, 2005, “
A Formal Two-Phase Method for Decomposition of Complex Design Problems
,”
ASME J. Mech. Des.
0161-8458,
127
, pp.
184
195
.
3.
Chen
,
L.
,
Ding
,
Z.
, and
Li
,
S.
, 2005, “
Tree-Based Dependency Analysis in Decomposition and Re-Decomposition of Complex Design Problems
,”
ASME J. Mech. Des.
0161-8458,
127
, pp.
12
23
.
4.
Chen
,
L.
, and
Li
,
S.
, 2005, “
Analysis of Decomposability and Complexity for Design Problems in the Context of Decomposition
,”
ASME J. Mech. Des.
0161-8458,
127
, pp.
545
557
.
5.
Simon
,
H. A.
, 1996,
The Sciences of the Artificial
,
MIT
,
Cambridge, MA
.
6.
Steward
,
D. V.
, 1981, “
The Design Structure System: A Method for Managing the Design of Complex Systems
,”
IEEE Trans. Eng. Manage.
0018-9391,
28
, pp.
71
74
.
7.
Fernandez
,
C.
, 1998, “
Integration Analysis of Product Architecture to Support Effective Team Co-Location
,” MS thesis, MIT, Cambridge, MA.
8.
Thebeau
,
R.
, 2001, “
Knowledge Management of System Interfaces and Interactions for Product Development Processes
,” MS thesis, MIT, Cambridge, MA.
9.
Sharman
,
D. M.
, and
Yassine
,
A. A.
, 2004, “
Characterizing Complex Product Architectures
,”
J. Syst. Eng.
0022-4820,
7
, pp.
35
60
.
10.
Steward
,
D. V.
, 1965, “
Partitioning and Tearing Systems of Equations
,”
SIAM (Soc. Ind. Appl. Math.) J. Numer. Anal.
0036-1429,
2
, pp.
345
365
.
11.
Warfield
,
J. N.
, 1973, “
Binary Matrices in System Modeling
,”
IEEE Trans. Syst. Man Cybern.
0018-9472,
3
, pp.
441
449
.
12.
Kusiak
,
A.
,
Larson
,
T. N.
, and
Wang
,
J.
, 1994, “
Reengineering of Design and Manufacturing Processes
,”
Comput. Ind. Eng.
0360-8352,
26
, pp.
521
536
.
13.
Altus
,
S. S.
,
Kroo
,
I. M.
, and
Gage
,
P. J.
, 1996, “
A Genetic Algorithm for Scheduling and Decomposition of Multidisciplinary Design Problems
,”
ASME J. Mech. Des.
0161-8458,
118
, pp.
486
489
.
14.
Li
,
S.
, 2009, “
Matrix-Based Decomposition Algorithms for Engineering Applications: The Survey and Generic Framework
,”
Int. J. Prod. Dev.
,
9
, pp.
78
110
.
15.
Danilovic
,
M.
, and
Browning
,
T. R.
, 2007, “
Managing Complex Product Development Projects With Design Structure Matrices and Domain Mapping Matrices
,”
Int. J. Proj. Manage.
0263-7863,
25
, pp.
300
314
.
16.
Lindemann
,
U.
,
Maurer
,
M.
, and
Braun
,
T.
, 2008,
Structural Complexity Management: An Approach for the Field of Product Design
,
Springer
,
Berlin
.
17.
McCormick
,
W. T.
,
Schweitzer
,
P. J.
, and
White
,
T. W.
, 1972, “
Problem Decomposition and Data Reorganization by a Clustering Technique
,”
Oper. Res.
0030-364X,
20
, pp.
993
1009
.
18.
King
,
J. R.
, and
Nakornchai
,
V.
, 1982, “
Machine-Component Group Formation in Group Technology: Review and Extension
,”
Int. J. Prod. Res.
0020-7543,
20
, pp.
117
133
.
19.
King
,
J. R.
, 1980, “
Machine-Component Group in Production Flow Analysis: An Approach Using a Rank Order Clustering Algorithm
,”
Int. J. Prod. Res.
0020-7543,
18
, pp.
213
232
.
20.
Kusiak
,
A.
, and
Chow
,
W. S.
, 1987, “
Efficient Solving of the Group Technology Problem
,”
J. Manuf. Syst.
0278-6125,
6
, pp.
117
124
.
21.
Kusiak
,
A.
, 2000,
Computational Intelligence in Design and Manufacturing
,
Wiley
,
New York
.
22.
Kusiak
,
A.
, and
Cheng
,
C. H.
, 1990, “
A Branch-and-Bound Algorithm for Solving the Group Technology Problem
,”
Ann. Operat. Res.
0254-5330,
26
, pp.
415
431
.
23.
Kusiak
,
A.
, and
Wang
,
J.
, 1993, “
Decomposition of the Design Process
,”
ASME J. Mech. Des.
0161-8458,
115
, pp.
687
695
.
24.
Suh
,
N. P.
, 1990,
The Principles of Design
,
Oxford University Press
,
New York
.
25.
Clausing
,
D.
, 1994,
Total Quality Development: A Step-by-Step Guide to World-Class Concurrent Engineering
,
ASME
,
New York
.
26.
Weil
,
R. L.
, and
Kettler
,
P. C.
, 1971, “
Rearranging Matrices to Block-Angular Form for Decomposition (and Other) Algorithms
,”
Manage. Sci.
0025-1909,
18
, pp.
98
108
.
27.
Arabie
,
P.
, and
Hubert
,
L. J.
, 1990, “
The Bond Energy Algorithm Revisited
,”
IEEE Trans. Syst. Man Cybern.
0018-9472,
20
, pp.
268
274
.
28.
Michelena
,
N. F.
, and
Papalambros
,
P. Y.
, 1995, “
A Network Reliability Approach to Optimal Decomposition of Design Problems
,”
ASME J. Mech. Des.
0161-8458,
117
, pp.
433
440
.
29.
Michelena
,
N. F.
, and
Papalambros
,
P. Y.
, 1997, “
A Hypergraph Framework for Optimal Model-Based Decomposition of Design Problems
,”
Comput. Optim. Appl.
0926-6003,
8
, pp.
173
196
.
30.
Krishnamachari
,
R. S.
, and
Papalambros
,
P. Y.
, 1997, “
Optimal Hierarchical Decomposition Synthesis Using Integer Programming
,”
ASME J. Mech. Des.
0161-8458,
119
, pp.
440
447
.
31.
Everitt
,
B.
, 1993,
Cluster Analysis
,
Wiley
,
New York
.
32.
Dhillon
,
I. S.
, 2001, “
Co-Clustering Documents and Words Using Bipartite Spectral Graph Partitioning
,”
Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
, San Francisco, CA, pp.
269
274
.
33.
Garey
,
M. R.
, and
Johnson
,
D. S.
, 1979,
Computers and Intractability: A Guide to the Theory of NP-Completeness
,
Freedman
,
New York
.
34.
Kernighan
,
B. W.
, and
Lin
,
S.
, 1970, “
An Efficient Heuristic Procedure for Partitioning Graphs
,”
Bell Syst. Tech. J.
0005-8580,
49
, pp.
291
307
.
35.
Fiduccia
,
C. M.
, and
Mattheyses
,
R. M.
, 1982, “
A Linear-Time Heuristic for Improving Network Partitions
,”
Proceedings of the 19th IEEE Design Automation Conference
, pp.
174
181
.
36.
Hall
,
K. M.
, 1970, “
An r-Dimensional Quadratic Placement Algorithm
,”
Manage. Sci.
0025-1909,
17
, pp.
219
229
.
37.
Fiedler
,
M.
, 1973, “
Algebraic Connectivity of Graphs
,”
Czech. Math. J.
0011-4642,
23
, pp.
298
305
.
38.
Karypis
,
G.
, and
Kumar
,
V.
, 1998, “
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
,”
SIAM J. Sci. Comput. (USA)
1064-8275,
20
, pp.
359
392
.
39.
Bui
,
T. N.
, and
Moon
,
B. R.
, 1996, “
Genetic Algorithm and Graph Partitioning
,”
IEEE Trans. Comput.
0018-9340,
45
, pp.
841
855
.
40.
Schloegel
,
K.
,
Karypis
,
G.
, and
Kumar
,
V.
, 2003, “
Graph Partitioning for High-Performance Scientific Simulations
,”
Sourcebook of Parallel Computing
,
J.
Dongarra
,
I.
Foster
,
G.
Fox
,
W.
Gropp
,
K.
Kennedy
,
L.
Torczon
, and
A.
White
, eds.,
Morgan Kaufmann
,
San Francisco, CA
.
41.
Sneath
,
P. H. A.
, and
Sokal
,
R. R.
, 1973,
Numerical Taxonomy: The Principles and Practice of Numerical Classification
,
W.H. Freeman and Company
,
San Francisco, CA
.
42.
Kannapan
,
S. M.
, and
Marshek
,
K. M.
, 1993, “
An Approach to Parametric Machine Design and Negotiation in Concurrent Engineering
,”
Concurrent Engineering: Automation, Tools and Techniques
,
A.
Kusiak
, ed.,
Wiley
,
New York
, pp.
509
533
.
43.
Li
,
S.
, 2005, “
A Formal Decomposition-Based Redesign Methodology for Rapid Design Customization
,” Ph.D. thesis, University of Toronto, Toronto, Canada.
44.
Rinderle
,
J. R.
, and
Suh
,
N. P.
, 1982, “
Measures of Functional Coupling in Design
,”
ASME J. Eng. Ind.
0022-0817,
104
, pp.
383
388
.
You do not currently have access to this content.