Affiliation:
1. Department of Mechanical Engineering and Applied Mechanics, The University of Michigan, 2250 G. G. Brown Building, Ann Arbor, MI 48109-2125
Abstract
Optimal design of large engineering systems modeled as nonlinear programming problems remains a challenge because increased size reduces reliability and speed of numerical optimization algorithms. Decomposition of the original model into smaller coordinated submodels is desirable or even necessary. The article presents a methodology for optimal model-based decomposition of design problems, whether or not initially cast as optimization models. The overall model is represented by a hypergraph that is optimally partitioned into weakly-connected subgraphs satisfying partitioning constraints. The formulation is robust enough to account for computational demands and resources, and the strength of interdependencies between the design relations contained in the model. This decomposition methodology is applied to a vehicle powertrain system design model consisting of engine, torque converter, transmission, and wheel-tire assemblies, with 87 design relations and 119 design and state/behavior variables.
Subject
Computer Graphics and Computer-Aided Design,Computer Science Applications,Mechanical Engineering,Mechanics of Materials
Reference31 articles.
1. Alpert, C. J., and Yao, S. -Z., 1995, “Spectral Partitioning: The More Eigenvectors, The Better,” Proceedings, 32nd ACM/IEEE Design Automation Conference, pp. 195–200.
2. Balling, R. J., and Sobieszczanski-Sobieski, J., 1994, “Optimization of Coupled Systems: A Critical Overview of Approaches,” Proceedings, 5th AIAA/NASA/USAF/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Panama City, pp. 753–773.
3. Barnard, S. T., and Simon, H. D., 1993, “A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems,” Proceedings, 6th SIAM Conference on Parallel Processing for Scientific Computing, pp. 711–718.
4. Bui, T. N., and Moon, B. R., 1994, “A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut Partitioning Problem on Hypergraphs,” Proceedings, 31th ACM/IEEE Design Automation Conference, pp. 664–669.
5. Donath, W. E., 1988, “Logic Partitioning,” Physical Design Automation of VLSI Systems, Chapter 3, B. T. Preas and M. J. Lorenzetti, eds., Benjamin Cummings, Menlo Park, CA.
Cited by
43 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献