Minimize: With Respect To: Subject To:

1. Minimize: With Respect To: Subject To: Minimize:With Respect To:Subject To: Minimize:With Respect To:Subject To: Start Minimize:With Respect To:Subject To: Minimize:With Respect To:Subject To: 1. Evaluate system model using initial subsystem design and extract boundary conditions for subsystem model. Minimize:With Respect To:Subject To: Minimize:With Respect To:Subject To: 2. Update subsystem boundary conditions using stochastic variations. local variables local variables 3. Perform design optimization using subsystem model and most recent stochastic subsystem boundary conditions. Disciplinary Analysis 2 Disciplinary Analysis 1 4. Evaluate system model using updated subsystem design and extract new boundary conditions for subsystem model. No Max cycle number exceeded? Update subsystem boundary conditions? No Yes Yes Stop 1 100 kN 2 Structural Optimization Using Decomposition Project Overview Decomposing a problem into a global/local model reduces the convergence time for complex optimization problems. This research focused on comparing the common methods of multidisciplinary structural optimization by decomposition. Further exploration included a detailed study of the COMPOSE algorithm, specifically its performance and application to various problems. This involved solving a simple beam bending problem using COMPOSE and the All-At-Once (AAO) method, followed by comparing the results. Collaborative Optimization Analytical Target Cascading COMPOSE Algorithm All-At-Once • Nested optimization • Bi-level hierarchy • Sends copies of variables to lower level • Sometimes difficult to locate global minimum • Sequence of subproblems at each level • Two or more level hierarchy • Variable sharing occurs between related elements • Computationally expensive, but efficient • COMPonent Optimization within a System Environment • Global analysis followed by local optimization • Updates local boundary conditions • Complex problems require stochastic BC updates • Optimizes entire system at the same time • Non-hierarchy • Used to locate global minimum • Computationally most expensive Beam Bending Example Problem Problem Formation Results and Discussion Two I-beams, bounded at the ends, contain a single load of 100 kN applied at the junction point B. The objective is to minimize the volume of section 1 with respect to the I-beam design variables h1, l1, t1, and f1. The problem is subject to a minimum moment constraint of 300,000 N-m at point A. Each design variable is subject to upper and lower boundary values. This problem was used to demonstrate the COMPOSE algorithm and the AAO method. The AAO method proved to find the better optimal design and converged faster. However, the global analysis of this problem was simple. For a complex global analysis, the required computational cost is dramatically increased. The COMPOSE method reduces the number of global analysis, thus decreasing the cost. A B C Beam Diagram Objective Function Values Real Life Application and Future Research Certain problems, like the design of rails in a truck chassis for crashworthiness, can contain hundreds of design variables. The computational expense of solving problems of this magnitude is substantial using AAO. When strong coupling exists between the global and local model, decomposing the problem can largely decrease the analysis time of the optimization process. For future research, one can explore the range of solvable problems by decomposition, specifically with the COMPOSE algorithm. The addition of reliability based design optimization would further benefit the use of these methods. David Wyrembelski Ron C. Averill (Advisor) Department of Mechanical Engineering Michigan State University Rails (Local Model) Global Model of Truck for Crashworthiness