0
Research Papers

Optimal Partitioning and Coordination Decisions in Decomposition-Based Design Optimization

[+] Author and Article Information
James T. Allison

 The MathWorks, Inc., Natick, MA 01760james.allison@mathworks.com

Michael Kokkolaras

Department of Mechanical Engineering, University of Michigan, G.G. Brown Building, Ann Arbor, MI 48109mk@umich.edu

Panos Y. Papalambros

Department of Mechanical Engineering, University of Michigan, G.G. Brown Building, Ann Arbor, MI 48109pyp@umich.edu

J. Mech. Des 131(8), 081008 (Jul 27, 2009) (8 pages) doi:10.1115/1.3178729 History: Received May 17, 2007; Revised April 15, 2009; Published July 27, 2009

The solution of complex system design problems using decomposition-based optimization methods requires determination of appropriate problem partitioning and coordination strategies. Previous optimal partitioning techniques have not addressed the coordination issue explicitly. This article presents a formal approach to simultaneous partitioning and coordination strategy decisions that can provide insights on whether a decomposition-based method will be effective for a given problem. Pareto-optimal solutions are generated to quantify tradeoffs between the sizes of subproblems and coordination problems as measures of the computational costs resulting from different partitioning and coordination strategies. Promising preliminary results with small test problems are presented. The approach is illustrated on an electric water pump design problem.

FIGURES IN THIS ARTICLE
<>
Copyright © 2009 by American Society of Mechanical Engineers
Your Session has timed out. Please sign back in to continue.

References

Figures

Grahic Jump Location
Figure 1

Digraph representation of the example system

Grahic Jump Location
Figure 2

Independent (P,C) optimization approach

Grahic Jump Location
Figure 8

CS and SSmax histograms for A2

Grahic Jump Location
Figure 9

Optimization results for A2

Grahic Jump Location
Figure 10

Optimal P/C results for pump problem

Grahic Jump Location
Figure 3

P→C sequential optimization

Grahic Jump Location
Figure 4

C→P sequential optimization

Grahic Jump Location
Figure 5

Simultaneous (P∥C) optimization

Grahic Jump Location
Figure 6

CS and SSmax histograms for A1

Grahic Jump Location
Figure 7

Optimization results for A1

Tables

Errata

Discussions

Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In