# An Enhanced Collaborative Optimization Approach with Design Structure Matrix Algorithms to Group and Decouple Multidisciplines

Authors: Xifan Yao; Jifeng Zhou; Yongxiang Li; Erhui Liu
Journal: Mathematical Problems in Engineering
 (2016)

---

## Abstract

To improve the solution efficiency and reliability of multidisciplinary design optimization (MDO), an enhanced MDO approach, called sequenced collaborative optimization (SCO), is proposed. The proposed approach introduces the design structure matrix (DSM) to describe the coupling effects among disciplines and aggregates those mutually coupling disciplines into the strong tie groups among similar ones and the weak tie among heterogeneous ones through clustering algorithms. Further, those in the same group are sequenced by the DSM division algorithm. Moreover, by adding constraints, the groups are made independent, resulting in a tree structure without loops, thus decoupling the original multidisciplinary problem into several independent collaborative optimization modules. In the end, an example is employed to verify the efficiency and reliability of the approach.


---

## Body

## 1. Introduction

Multidisciplinary design optimization (MDO) is a kind of methodology to design complex systems and subsystems by fully exploring and utilizing the interaction mechanism of the systems. Logically, a complex engineering system can usually be divided into multiple disciplines, each of which is an abstract form of one or several fields. In the process of system level optimization design, the coupling effect among various disciplines should be taken into account, thus to realize the optimization solution [1]. In designing complex products, the application of MDO greatly improves the performance of complex products, shortens the design cycle, and is of great significance.The essence of MDO is reflected in using knowledge from multiple disciplines to integrate models and analysis tools, organizing and managing the designing process through the effective design and optimization strategy and making full use of the coordination effect caused by the interaction among various disciplines to obtain the overall optimal solution [2]. Optimization strategy not only affects the results of MDO but also plays a crucial role in the optimization efficiency [3, 4]. With the improvement of MDO, researches mainly focus on its application involved with complicatedly designed objects and corresponding MDO platforms [5]. Quantities of MDO platforms, such as IHAT (Integrated Hypersonic Aeromechanics Tool), MDOPT (multidisciplinary design optimization), IDEA (Integrated Design and Engineering Analysis) [6], OpenMDAO [7], and Isight [8], simplify MDO design process and enhance its efficiency. There are also many researches on the applications of MDO. For example, Meruva et al. [9] applied multidisciplinary approaches in predicting the wear and fatigue life for the optimization of lead screw actuators; Cheng et al. [10] presented MDO method for a hydrostatic rotary table based on sensitivity analysis, which was used to achieve an optimal design with less cost and better performance; Su et al. [11] applied MDO technology into the design of an integral bus body structure to improve its synthetic performance, considering lightweight, stiffness, strength, vibration mode, and rollover. The research results of the optimization platforms and application technologies mentioned above are of significance in designing complex products. However, due to complex information interaction and coupling among various disciplines, the application of MDO faces the obstacles of complicated coordination process and heavy computation cost [12].Therefore, this paper proposes a so-called sequenced collaborative optimization (SCO) approach, where design structure matrix (DSM) is applied into the solving process of MDO and is used to describe links among various disciplines. Through clustering algorithms, the multiple disciplines are divided into different groups with strong ties in the same group and weak ties in different ones. The disciplines in the same group are sequenced by the division algorithm, while the groups are made independent by adding some constraints. As such, tree structures without loop are obtained so as to avoid low efficiency and nested loops that are difficult to converge and facilitate the practical application of MDO technology.


## 2. DSM Modeling and Analysis of Discipline Interaction

DSM is a matrix tool for the planning and analysis of product design process developed by Dr. Steward [13]. The design of modern products is increasingly integrating knowledge, information, and technology and its objects are also becoming more and more complicated. For example, the design of large complex products, such as spacecraft, aircraft, automobiles, and ships, is a multidisciplinary, complex, and high-speed iterative process. DSM can directly display the relationships between disciplines or subsystems and improves design quality and efficiency. For example, Habib [14] modeled the subsystems of mechanical and electrical products by DSM, managed information interaction between subsystems and components, and modularized design objects, which simplified the design process; Lambe and Martins [15] extended DSM, on the basis of which components were added to define iterative processes, different line types were used to display data and process connection independently, and components executed sequentially were defined by number. There are also some researches on the application process of the extended DSM in MDO models. For example, Su et al. [5] put forward general multidisciplinary optimization framework based on a discipline relationship matrix, gave a set of normative, general, and automatic solving strategies by means of discipline input/output variables and the conversion relationship of MDO optimization model, and provided a more intuitive and convenient way for the optimization platform to solve MDO problems. The above researches explored the application of DSM into MDO issues but did not connect DSM and the solving process of MDO directly. Instead, they mainly focused on studying information management and design planning by DSM and lacked discussion on the actual solving process. In [16], fuzzy DSM was used to describe the multidisciplinary design process, which was simplified and coupled. It reduced the iteration between subjects, but the application is rather complicated when the number of subjects is relatively large. Closely connecting DSM and the solving process of MDO, this paper simplifies discipline relationships by DSM and uses concrete optimization examples to elaborate it.


### 2.1. Discipline Interaction Modeling

When DSM is used to represent the interaction relationships between disciplines,n disciplines are first sequentially arranged, forming n×n matrix, whose rows and columns correspond to disciplines with the same sequence. The units on the diagonal of the matrix represent disciplines and other elements are interaction relationships between disciplines, where 1 and 0 indicate whether there is an interaction or not, respectively. If subject i needs the information output of subject j as information input, then the matrix element aij=1 or else aij=0. Figure 1 shows the DSM of the interaction information of a multidisciplinary optimization problem. The correlation information is composed of eight disciplines. Each row in the figure represents the information input of the corresponding discipline, while each column stands for the information output for other disciplines. The unit information above the diagonal indicates the disciplinary feedback information, where subsequent discipline results will affect previous results. The unit information below the diagonal refers to the disciplinary feed-forward information, where previous results will influence subsequent results. At the time of design optimization, transformation processing of matrix should be utilized to convert the subject matrix into the lower triangular form as far as possible, so as to avoid the complex nested loop and improve optimization efficiency by solving multiple disciplines sequentially.Figure 1
DSM for representing disciplines.
(a) (b)


### 2.2. Clustering Analysis

Clustering algorithm can reorder disciplines in the DSM and form targeted discipline clustering modules that comprise disciplines with strong ties and meanwhile among which minimized constrained association is kept. In optimizing and reconfiguring the initial DSM of a research object, two core data points, that is bid value and coordination cost [17], are introduced. A discipline is selected arbitrarily and is grouped by calculating its bid in all groups. The bid of a discipline shows dependencies between the subject itself and other groups, which can be calculated as follows:(1)Bidj=∑IjλdNjλb,where Bidj is the bid value of thej(th) clustering module for the selected discipline; ∑Ij stands for the sum of the interactions among the system discipline and all disciplines in thej(th) clustering module; Nj is the number of disciplines in thej(th) clustering module; λd represents the interactive weight exponent; and λb refers to the bid exponent of the clustering module.The coordination cost is the objective function, which is calculated circularly for the minimum value to determine the final clustering scheme. It is proportional to the number of disciplines in the clustering modules and the interaction among disciplines. The coordination cost value can be divided into those within clustering modules and those outside the modules [17, 18], as calculated as follows:(2)IntraC=DSMj,k+DSMk,j∗Nyλc,ExtraC=DSMj,k+DSMk,j∗Nλc,TotalC=∑IntraC+∑ExtraC,where IntraC represents the coordination cost of a particular clustering module; ExtraC is the clustering cost outside a particular clustering module; TotalC stands for the overall coordination cost of the target system; DSM(j,k) and DSM(k,j) indicate the interaction between subjects j and k and that between subjects k and j, respectively; Ny and N are the number of disciplines of clustering module Y and that of the target system, respectively; and λc is the weight exponent of the clustering modules.By a loop calculation of bid values and coordination costs, the clustering module that the target system discipline belongs to can be identified, and finally the clustering operation of the DSM of the target system can be completed. Due to its strong advantage in matrix operations, Matlab software is used for programming in this paper so as to achieve the DSM clustering algorithm of a target system. The specific procedures are as follows:(1)
Initialize the DSM, where each discipline is taken as a module.(2)
Calculate the coordination cost of the initial DSM,TotalC.(3)
Arbitrarily select a discipline from the DSM matrix to form a module.(4)
Calculate the bids of all other modules relatively to the particular discipline selected.(5)
Place the selected discipline in the module which has the highest bid value.(6)
If the newly calculatedTotalC is smaller than the previous one, the selected discipline is incorporated in the module, or else it remains independent of the module.(7)
Choose a new task to repeat Steps(3)–(6) until all tasks have been traversed and no further clustering operations can be carried out.After the above clustering algorithm is applied to the discipline relation matrix in Figure1, the eight subdisciplines are aggregated into two subgroups according to their interaction relationships, that is, B, C, D, G, and H in a group and A, E, and F in the other one, where in-group interactions keep close while cross-group interactions remain scarce, which is consistent with the expected result. The curve of coordination cost is shown in Figure 2, and the clustered result is shown in Figure 3.Figure 2
The curve of coordination cost.Figure 3
The result after clustering operation on the DSM in Figure1.


### 2.3. Partitioning Operation

After clustering analysis, the discipline matrix forms multiple discipline groups, which lays a foundation for the parallel calculation of multidiscipline optimization, but the coupling relations within a discipline group is still complicated, which is not conducive to the solving process. Partitioning algorithm can rearrange the disciplines in the same group so as to achieve the purpose of reducing feedback relevance; that is, try to reduce cells where there are correlations among corresponding disciplines represented on the upper triangular part of the discipline subgroup matrix and convert it into a lower triangular matrix as far as possible. The specific steps are as follows:(1)
Determine the discipline elements in the system that can perform independently without requiring the output information of other disciplines as the input information; that is, find out the row whose cell values are zero. Place such elements in the forefront of the matrix and at the meantime convert the corresponding column. Repeat the step until all the elements of zero values in the corresponding row are rearranged completely.(2)
Determine the discipline elements that do not provide information for other disciplines; that is, find out the column whose cell values are zero. As the disciplines corresponding to the column do not provide information for other disciplines, place the column as the last one of the matrix and at the same time convert the corresponding row. Repeat the step until all the elements of zero values in the corresponding column are rearranged completely.(3)
After the above two steps, if all the elements of the matrix targeted have been rearranged, partitioning operation is completed. If not, there are coupling relationships between the remaining discipline elements. Finding out the coupling disciplines through, for example, path search method, adjacency matrix method, reachable matrix method, and triangulation algorithm, is needed.(4)
Treat the coupling disciplines as a whole, and use an element symbol to represent them in the discipline matrix. Further repeat a partitioning operation on the new formed matrix until all elements complete rearrangement.(5)
Split the elements that are treated as a whole. The resulting matrix obtained is the DSM of the targeted system after being partitioned and reconstructed.According to the above steps, the result as shown in Figure4 is obtained after partitioning operation on the two clustered subgroups shown in Figure 3.Figure 4
The result after partitioning operation on the two clustered subgroups in Figure3.


## 2.1. Discipline Interaction Modeling

When DSM is used to represent the interaction relationships between disciplines,n disciplines are first sequentially arranged, forming n×n matrix, whose rows and columns correspond to disciplines with the same sequence. The units on the diagonal of the matrix represent disciplines and other elements are interaction relationships between disciplines, where 1 and 0 indicate whether there is an interaction or not, respectively. If subject i needs the information output of subject j as information input, then the matrix element aij=1 or else aij=0. Figure 1 shows the DSM of the interaction information of a multidisciplinary optimization problem. The correlation information is composed of eight disciplines. Each row in the figure represents the information input of the corresponding discipline, while each column stands for the information output for other disciplines. The unit information above the diagonal indicates the disciplinary feedback information, where subsequent discipline results will affect previous results. The unit information below the diagonal refers to the disciplinary feed-forward information, where previous results will influence subsequent results. At the time of design optimization, transformation processing of matrix should be utilized to convert the subject matrix into the lower triangular form as far as possible, so as to avoid the complex nested loop and improve optimization efficiency by solving multiple disciplines sequentially.Figure 1
DSM for representing disciplines.
(a) (b)


## 2.2. Clustering Analysis

Clustering algorithm can reorder disciplines in the DSM and form targeted discipline clustering modules that comprise disciplines with strong ties and meanwhile among which minimized constrained association is kept. In optimizing and reconfiguring the initial DSM of a research object, two core data points, that is bid value and coordination cost [17], are introduced. A discipline is selected arbitrarily and is grouped by calculating its bid in all groups. The bid of a discipline shows dependencies between the subject itself and other groups, which can be calculated as follows:(1)Bidj=∑IjλdNjλb,where Bidj is the bid value of thej(th) clustering module for the selected discipline; ∑Ij stands for the sum of the interactions among the system discipline and all disciplines in thej(th) clustering module; Nj is the number of disciplines in thej(th) clustering module; λd represents the interactive weight exponent; and λb refers to the bid exponent of the clustering module.The coordination cost is the objective function, which is calculated circularly for the minimum value to determine the final clustering scheme. It is proportional to the number of disciplines in the clustering modules and the interaction among disciplines. The coordination cost value can be divided into those within clustering modules and those outside the modules [17, 18], as calculated as follows:(2)IntraC=DSMj,k+DSMk,j∗Nyλc,ExtraC=DSMj,k+DSMk,j∗Nλc,TotalC=∑IntraC+∑ExtraC,where IntraC represents the coordination cost of a particular clustering module; ExtraC is the clustering cost outside a particular clustering module; TotalC stands for the overall coordination cost of the target system; DSM(j,k) and DSM(k,j) indicate the interaction between subjects j and k and that between subjects k and j, respectively; Ny and N are the number of disciplines of clustering module Y and that of the target system, respectively; and λc is the weight exponent of the clustering modules.By a loop calculation of bid values and coordination costs, the clustering module that the target system discipline belongs to can be identified, and finally the clustering operation of the DSM of the target system can be completed. Due to its strong advantage in matrix operations, Matlab software is used for programming in this paper so as to achieve the DSM clustering algorithm of a target system. The specific procedures are as follows:(1)
Initialize the DSM, where each discipline is taken as a module.(2)
Calculate the coordination cost of the initial DSM,TotalC.(3)
Arbitrarily select a discipline from the DSM matrix to form a module.(4)
Calculate the bids of all other modules relatively to the particular discipline selected.(5)
Place the selected discipline in the module which has the highest bid value.(6)
If the newly calculatedTotalC is smaller than the previous one, the selected discipline is incorporated in the module, or else it remains independent of the module.(7)
Choose a new task to repeat Steps(3)–(6) until all tasks have been traversed and no further clustering operations can be carried out.After the above clustering algorithm is applied to the discipline relation matrix in Figure1, the eight subdisciplines are aggregated into two subgroups according to their interaction relationships, that is, B, C, D, G, and H in a group and A, E, and F in the other one, where in-group interactions keep close while cross-group interactions remain scarce, which is consistent with the expected result. The curve of coordination cost is shown in Figure 2, and the clustered result is shown in Figure 3.Figure 2
The curve of coordination cost.Figure 3
The result after clustering operation on the DSM in Figure1.


## 2.3. Partitioning Operation

After clustering analysis, the discipline matrix forms multiple discipline groups, which lays a foundation for the parallel calculation of multidiscipline optimization, but the coupling relations within a discipline group is still complicated, which is not conducive to the solving process. Partitioning algorithm can rearrange the disciplines in the same group so as to achieve the purpose of reducing feedback relevance; that is, try to reduce cells where there are correlations among corresponding disciplines represented on the upper triangular part of the discipline subgroup matrix and convert it into a lower triangular matrix as far as possible. The specific steps are as follows:(1)
Determine the discipline elements in the system that can perform independently without requiring the output information of other disciplines as the input information; that is, find out the row whose cell values are zero. Place such elements in the forefront of the matrix and at the meantime convert the corresponding column. Repeat the step until all the elements of zero values in the corresponding row are rearranged completely.(2)
Determine the discipline elements that do not provide information for other disciplines; that is, find out the column whose cell values are zero. As the disciplines corresponding to the column do not provide information for other disciplines, place the column as the last one of the matrix and at the same time convert the corresponding row. Repeat the step until all the elements of zero values in the corresponding column are rearranged completely.(3)
After the above two steps, if all the elements of the matrix targeted have been rearranged, partitioning operation is completed. If not, there are coupling relationships between the remaining discipline elements. Finding out the coupling disciplines through, for example, path search method, adjacency matrix method, reachable matrix method, and triangulation algorithm, is needed.(4)
Treat the coupling disciplines as a whole, and use an element symbol to represent them in the discipline matrix. Further repeat a partitioning operation on the new formed matrix until all elements complete rearrangement.(5)
Split the elements that are treated as a whole. The resulting matrix obtained is the DSM of the targeted system after being partitioned and reconstructed.According to the above steps, the result as shown in Figure4 is obtained after partitioning operation on the two clustered subgroups shown in Figure 3.Figure 4
The result after partitioning operation on the two clustered subgroups in Figure3.


## 3. Decoupling and Optimization

With the continuous development of MDO technology, the idea of multidisciplines has gradually evolved into a modular optimal strategy. As mentioned above, through clustering operation of multidisciplinary interaction matrix, mutually coupling disciplines can be aggregated into different disciplinary groups with strong ties among similar ones and weak ties among heterogeneous ones. And the solving order of disciplines in each group can be further rearranged after division operation of each discipline group. Even so, the discipline interaction among different groups and the coupling relationships between different disciplines in the same group have not be completely eliminated. By adding the specified constraints, different disciplinary groups can be made independent of each other, and disciplines within the same group can be completely decoupled, through which the parallel computing of multidisciplinary groups can be realized. As shown in Figure5, the decoupling directed graph is obtained after clustering and division operations. The direction of an arrow expresses the dependencies between the disciplines. For example, the arrows from discipline G to disciplines B and C represent that the analysis of discipline G depends on the outputs of disciplines B and C, and the arrows from disciplines A, B, C, and H to discipline G indicate that the analysis of disciplines A, B, C, and H depends on the output of discipline G. The solid lines represent the reserved disciplinary correlations and the dotted lines represent the disciplinary correlation which should be removed by adding constraints. In order to make the two disciplinary groups independent of each other, after some constraints are added to remove the interactions between A and G, H and A, H and E, and F and C, parallel analysis of the two disciplinary groups can be realized. In order to make the disciplines in each disciplinary subgroup solve sequentially in accordance with the result of division operation, after some specified constraints are added to remove the coupling correlations between G and B, G and C, B and H, and A and E, subgroup 1 can be solved in the order of D, G, B, C, and H, and subgroup 2 can be solved in the order of A, E, and F, without any complex multidisciplinary analysis.Figure 5
The directed graph for decoupling.The general idea of this study is the pretreatment of interactions between disciplines for complex multidisciplinary problems based on disciplinary DSM. Through matrix clustering algorithm, multidisciplines are divided into different disciplinary subgroups, which are sorted further by matrix division operation. A directed graph of disciplinary dependency is derived from the clustering and division results. Disciplinary interactions between subgroups and disciplinary couplings within the same group are disconnected by applying specified constraints, meeting the application demand for the sequenced collaborative optimization (SCO), as shown in Figure6. The system layer and disciplinary subgroups keep in touch by data exchange. Disciplinary subgroups are independent of each other and each subgroup has an analyzer and an optimizer. Disciplinary analysis can be performed sequentially in each subgroup because of the pretreatment of the interactions between disciplines. This strategy improves the optimization efficiency. At the system level, the optimization target is the original objective function, and the optimization variables are constituted by global design variable xs, coupling variables among subgroups yk_outs, and coupling variables within each subgroup yk_ins. System constraints are constituted by the optimal values Rk∗ from each subgroup used to coordinate the consistency of the coupling variables between the system and subgroups. At subgroup level, optimization variables are constituted by system variables xsl that the subgroups need, local design variables xkl, and the coupling variables yk_inl and yk_outl within and among subgroups. The optimization target is to minimize the deviations between xsl, yk_inl, and yk_outl and their responses passed down from the system level. Optimal values xsl, xkl, yk_inl, and yk_outl are inputs to the analyzer by the subgroup optimizer, whereas the values of equality constraints hk, the values of inequality constraints gk, and the coupling values yk_out and yk_in are returned as outputs. Although there still exist a large number of disciplinary correlations within the subgroups as Figure 6 shows, the association within the subgroups is an unidirectional tree structure because of the pretreatment of interactions between disciplines. Therefore, the analyzer in the subgroups can conduct the disciplinary analysis sequentially as the division order.Figure 6
The SCO framework.The optimization framework of SCO overcomes some drawbacks of traditional MDO strategies. It is convenient for designers to understand the complex problems by the pretreatment of interactions between disciplines based on DSM before optimization. Compared with the multidisciplinary feasible (MDF) method, although SCO adds some constraints to design space, it does not require complex multidisciplinary analysis in each subgroup. And the decoupling process belongs to the pretreatment process of the optimization, improving the solving efficiency. This improvement effect is more obvious when the disciplines couple complexly. Compared with the individual discipline feasible (IDF) method, SCO still retains a number of disciplinary correlations and removes only part of coupling interactions by adding specific constraints pertinently. It maintains the invariance of the design space as much as possible and can get more satisfied optimal results. Compared with all-at-once (AAO) method, SCO does not increase the design dimensions of the original optimization problem excessively. Compared with the collaborative optimization (CO) method, SCO no longer treats a single discipline as an object but classifies closely linked disciplines into a group, greatly increasing the flexibility of parallel optimization.


## 4. Illustrative Example

In order to verify the feasibility of the proposed SCO in this study and compare it with AAO method, a mathematical model, with various disciplines and a high degree of coupling, is chosen as the optimization object. Specific expression of the model is given as follows [1]:(3)minf=x22+x3+y1+e-y2+x5-0.5x8+0.8y3-2.5y4+y62s.t.g1=y12-1≥0,g2=y230-1≤0-10≤x1≤100-10≤x2≤100-10≤x3≤100-10≤x4≤100-10≤x5≤100-10≤x6≤100-10≤x7≤100-10≤x8≤100,where(4)y1=x12+x2+x3-0.2y2,y2=y1+x1+x3,y3=x1+x33+x4-0.5y1+2y5,y4=x3-x5+0.5x6+y12-y3,y5=x1+x3-x7+y2+2.5y3+y7,y6=x12-y42+y8,y7=x1-x3+y1+0.2y6-3y9,y8=x1+x3-x8+1.5y2+y5,y9=x1+y4.The optimization problem consists of 8 design variables and 9 mutually coupling disciplines. The interactions between the disciplines are clearly shown in Figure7, with a total of 17 correlations.Figure 7
The DSM of disciplines.After the clustering analysis of the disciplinary interaction matrix, the nine disciplines are divided into two subgroups, namely, 1, 2, 3, 5, 7, and 8 in one subgroup and 4, 6, and 9 in the other one. The curve of coordination cost and the clustered result are, respectively, shown in Figures8 and 9. The most correlation relationships between disciplines gather within subgroups.Figure 8
The curve of coordination cost.Figure 9
The clustered result.Figure10 shows the result after the partitioning operation on the two clustering subgroups shown in Figure 9.Figure 10
The partitioned result.There are still some disciplinary correlations between the subgroups and some coupling interactions within each subgroup after the clustering and division operations. The directed graph for decoupling as shown in Figure11, can be derived from the clustering and division result in Figure 10. In order to meet the requirement of the SCO framework, some constraints are added to make two subgroups independent of each other and remove the coupling relations within subgroups, for example the dependencies from discipline 1 to discipline 2, discipline 3 to discipline 5, and the dependency between the two subgroups. The solid lines represent the reserved disciplinary correlations and the dotted lines represent the disciplinary correlations which should be removed. The figure still retains many disciplinary dependencies because these dependencies do not form any coupling association and will not affect the parallel optimization in the disciplinary subgroups. The output values of respective disciplines can be got after an analysis according to the discipline sequence obtained by the division.Figure 11
The directed graph for decoupling.


## 5. Result

Table1 shows the optimized results obtained using AAO and SCO strategies. The target value obtained from SCO (i.e., −7.8670) is better than that from AAO (i.e., −7.3147), verifying the validity of the proposed SCO in this paper. AAO method converts state variables into independent optimization variables in the optimization process, which increases the scale of the original problem and makes the solving process harder. SCO method converts the original optimization problem into multiple subgroups of parallel analysis through the clustering analysis of the disciplinary matrix. The disciplinary analysis in each subgroup can be executed sequentially after the division and decoupling operations, which reduces the solving difficulty. It can be seen from the optimized result that SCO has a better optimization effect.Table 1
The optimized result.
(a) Method The optimized location x1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 SCO −1.3959 0.0677 −0.0187 −9.7973 −10 −10 −2.9131 −6.7511 AAO −1.2029 0.0830 0.6403 −10 −10 −10 1.0927 −5.1806  (b) Method The values of coupling variables Targetf y 1 y 2 y 3 y 4 y 5 y 6 y 7 y 8 y 9 SCO 2 0.0028 4.7440 3.2341 8.4686 −0.2540 −4.9452 8.2539 1.8393 −7.8670 AAO 2 0.8516 6.3816 3.2587 9.1610 −0.2500 −6.0606 8.9221 2.0558 −7.3147


## 6. Conclusion

This study uses DSM to describe disciplinary interactions for MDO problems, introduces two parameters, that is, bid values and coordination cost values, to achieve clustering algorithm for the disciplinary interaction matrix, and aggregates those mutually coupling disciplines into the groups with strong ties among similar ones and weak ties among heterogeneous ones. Further, those in the same group are sequenced by the division algorithm, and the number of disciplinary feedback correlations is reduced. A directed graph of disciplinary dependency is derived from the clustering and division results. By adding constraints, the groups are made independent and a tree structure with no coupling relation within the same subgroup is obtained, thus forming MDO approach enhanced with DSM algorithms, that is, a so-called sequenced collaborative optimization (SCO). Not only is SCO theoretically addressed but also a concrete example is used to compare SCO and AAO.Although the preliminary study suggests that SCO optimization framework works well in solving MDO problems, the illustrated example is not very complex. In future work, more complex optimization problems and models in the real world will be used to verify the solving process of the SCO framework through approximate modeling technology as well as clustering and division algorithms of DSM to deal with the relationships between disciplines.



---

*Source: 4340916-2016-08-21.xml*