Tree-Based Dependency Analysis in Decomposition and Re-decomposition of Complex Design Problems

2005 ◽  
Vol 127 (1) ◽  
pp. 12-23 ◽  
Author(s):  
Li Chen ◽  
Zhendong Ding ◽  
Simon Li

We have developed a formal method for decomposition of complex design problems in two phases: dependency analysis and matrix partitioning. Of the most distinct characteristic in this method is the support of cost-effective re-decomposition (as is often required in decomposition solution synthesis), where dependency analysis serves as a platform for the enabling of re-decomposition. Yet, this requires that the result of the dependency analysis be robust and thus reusable for re-decomposition. In this paper, after revealing the deficiency in the current practice of dependency analysis, we present an enhanced dependency analysis method that is built on ordinary tree structure (instead of binary tree structure). This new approach, which is more systematic, ensures robust dependency analysis, whose result is insensitive to the arrangement of a tree structure in tree-based dependency analysis. A complete set of tree-based algorithms is also provided, along with their applications to two design examples

2009 ◽  
Vol 43 (2) ◽  
pp. 48-60 ◽  
Author(s):  
M. Martz ◽  
W. L. Neu

AbstractThe design of complex systems involves a number of choices, the implications of which are interrelated. If these choices are made sequentially, each choice may limit the options available in subsequent choices. Early choices may unknowingly limit the effectiveness of a final design in this way. Only a formal process that considers all possible choices (and combinations of choices) can insure that the best option has been selected. Complex design problems may easily present a number of choices to evaluate that is prohibitive. Modern optimization algorithms attempt to navigate a multidimensional design space in search of an optimal combination of design variables. A design optimization process for an autonomous underwater vehicle is developed using a multiple objective genetic optimization algorithm that searches the design space, evaluating designs based on three measures of performance: cost, effectiveness, and risk. A synthesis model evaluates the characteristics of a design having any chosen combination of design variable values. The effectiveness determined by the synthesis model is based on nine attributes identified in the U.S. Navy’s Unmanned Undersea Vehicle Master Plan and four performance-based attributes calculated by the synthesis model. The analytical hierarchy process is used to synthesize these attributes into a single measure of effectiveness. The genetic algorithm generates a set of Pareto optimal, feasible designs from which a decision maker(s) can choose designs for further analysis.


2012 ◽  
Vol 479-481 ◽  
pp. 1403-1408
Author(s):  
Gang Lian Zhao ◽  
Yi Jiang ◽  
Yu Jun Chen ◽  
Yan Li Ma

Based on software Pro/ENGINEER and Visual C++ 2005,sub-module of parametric design of assembly with wide universality was done by using Pro/TOOLKIT, and the design procedure was introduced in details. Assembly relation of sub-components is transformed into binary tree structure to store and search parts, and the assembly relation is displayed by CTreeCtrl control. The corresponding parts can be quickly found in the binary tree. Engineering drawing was automatically generated and displayed by ProductView after loading a part, and in this way dimensions of different parts can be modified according to engineering drawing in asynchronous mode. The sub-module can meet the needs of parametric design of parts in the integrated simulation system.


Author(s):  
Stephen S. Altus ◽  
Ilan M. Kroo ◽  
Peter J. Gage

Abstract Complex engineering studies typically involve hundreds of analysis routines and thousands of variables. The sequence of operations used to evaluate a design strongly affects the speed of each analysis cycle. This influence is particularly important when numerical optimization is used, because convergence generally requires many iterations. Moreover, it is common for disciplinary teams to work simultaneously on different aspects of a complex design. This practice requires decomposition of the analysis into subtasks, and the efficiency of the design process critically depends on the quality of the decomposition achieved. This paper describes the development of software to plan multidisciplinary design studies. A genetic algorithm is used, both to arrange analysis subroutines for efficient execution, and to decompose the task into subproblems. The new planning tool is compared with an existing heuristic method. It produces superior results when the same merit function is used, and it can readily address a wider range of planning objectives.


1996 ◽  
Vol 29 (11) ◽  
pp. 1905-1917 ◽  
Author(s):  
Bing-Bing Chai ◽  
Tong Huang ◽  
Xinhua Zhuang ◽  
Yunxin Zhao ◽  
Jack Sklansky

Author(s):  
Tao Huang ◽  
Eric E. Anderson

This chapter provides a brief overview of systems theory and suggests that product designers could use systems theory and systems dynamics models to improve our understanding of complex Product Design research problems, to anticipate how and where changes in these dynamically evolving systems might occur and how they might interact with the current system to produce a new system with new behaviors, and to identify leverage points within the system where potential policy or design process changes might be introduced to produce effective solutions to these problems with minimum policy resistance. By investigating the current and future trends of the application of systems theory in Product Design research, this chapter invites multidisciplinary discussions of these topics.


Sign in / Sign up

Export Citation Format

Share Document