0
Research Papers

A Sequential Algorithm for Possibility-Based Design Optimization

[+] Author and Article Information
Jun Zhou

Mechanical Engineering Department, Oakland University, Rochester, MI 48309jzhou@oakland.edu

Zissimos P. Mourelatos1

Mechanical Engineering Department, Oakland University, Rochester, MI 48309mourelat@oakland.edu

1

Corresponding author.

J. Mech. Des 130(1), 011001 (Dec 07, 2007) (10 pages) doi:10.1115/1.2803250 History: Received July 26, 2006; Revised March 31, 2007; Published December 07, 2007

Deterministic optimal designs that are obtained without taking into account uncertainty/variation are usually unreliable. Although reliability-based design optimization accounts for variation, it assumes that statistical information is available in the form of fully defined probabilistic distributions. This is not true for a variety of engineering problems where uncertainty is usually given in terms of interval ranges. In this case, interval analysis or possibility theory can be used instead of probability theory. This paper shows how possibility theory can be used in design and presents a computationally efficient sequential optimization algorithm. After the fundamentals of possibility theory and fuzzy measures are described, a double-loop, possibility-based design optimization algorithm is presented where all design constraints are expressed possibilistically. The algorithm handles problems with only uncertain or a combination of random and uncertain design variables and parameters. In order to reduce the high computational cost, a sequential algorithm for possibility-based design optimization is presented. It consists of a sequence of cycles composed of a deterministic design optimization followed by a set of worst-case reliability evaluation loops. Two examples demonstrate the accuracy and efficiency of the proposed sequential algorithm.

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

References

Figures

Grahic Jump Location
Figure 1

Triangular membership function

Grahic Jump Location
Figure 2

Notation for PBDO

Grahic Jump Location
Figure 3

Shifting of feasible domain for only uncertain variables

Grahic Jump Location
Figure 4

Shifting of feasible domain for a combination of uncertain and random variables

Grahic Jump Location
Figure 5

Flowchart for the SPDO algorithm

Grahic Jump Location
Figure 6

Thin-walled pressure vessel

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