(2004) A Single-Loop Method For Reliability Based Design Optimization
(2004) A Single-Loop Method For Reliability Based Design Optimization
Proceedings
ASME 2004 Design Engineering Technical of DETC’04
Conferences and
ASME 2004 Design Engineering Technical Conferences and
Computers and Information in Engineering Conference
Computers
September and Information
28-October in Engineering
2, 2004, Conference
Salt Lake City, Utah, USA
Salt Lake City, Utah, September 28 – October 2, 2004
DETC2004-57255
DETC2004/DAC-57255
1
Corresponding author, Phone/Fax: (248)370-2686/370-4416
th
deterministic constraints in the feasible domain. This is done is the probability of violating the i deterministic constraint
sequentially until convergence is achieved. SORA appears to which is usually very small. In RBDO, the actual probability
be similar to the safety-factor approach reported in [30]. of failure must be less than the target probability of failure
Although SORA improves the computational efficiency of the which is usually approximated by the following first-order
RBDO process, its convergence rate is slow and not relation [32,33]
guaranteed. Another decoupled approach to perform RBDO p f ≈ Φ (− β t ) (4)
has also been proposed in [23,24]. However, it is restricted to where β t is the target reliability index and Φ is the standard
deterministic design variables in the design optimization loop. normal cumulative distribution function. Combining Eqs (1)
For the reliability requirement, a “ball” constraint of radius through (4) yields,
equal to the reliability index is satisfied. P (Gi (d, X, P) ≤ 0) = FG (0) ≤ Φ (− β t ), i = 1,K, n (5)
In this work, a single-loop RBDO method is presented. It i i
imposes the Karush-Kuhn-Tucker (KKT) optimality where the cumulative distribution function FG ( ) is described
i
formulation into an equivalent deterministic optimization and f X , P (x, p) is the joint probability density function of all
formulation. The proposed single-loop method does not need random variables and random parameters.
to calculate the MPP for each probabilistic constraint in order Before the proposed single-loop RBDO method is
to assess the reliability eliminating therefore, the reliability described in Section 3, a brief overview is presented of the
optimization loop of the conventional double-loop RBDO double-loop method with percentile formulation (DLP/PMA)
approach. If needed, the MPP’s can be easily calculated after and the Sequential Optimization and Reliability Assessment
the successful termination of the single-loop process. In (SORA) [22] method. This overview provides the basic ideas
general, the proposed single-loop RBDO approach has of both methods as they compare with the proposed single-
comparable efficiency with a deterministic optimization and loop RBDO method. It also describes the percentile
the same accuracy with the conventional double-loop RBDO formulation of the reliability assessment which is used in this
method. In contrast, the accuracy of the decoupled RBDO work.
methods is in general worse than the accuracy of the double-
loop approach. 2.1. Double-Loop RBDO Method
Section 2 of this report provides an overview of the The classical double-loop RBDO method employs two
RBDO methods. Subsequently, Section 3 describes the nested optimization loops; the design optimization loop (outer)
proposed single-loop RBDO method in detail. In Section 4, and the reliability assessment loop (inner). The latter is needed
the performance of the single-loop method is assessed using a for the evaluation of each probabilistic constraint in Eq. (1).
mathematical example, a beam example with two probabilistic For this reason, the double-loop RBDO method is
constraints and a vehicle side impact example. The efficiency computationally very expensive and therefore, almost
of the proposed single-loop method is compared with the impractical for large-scale design problems. Based on Eq. (5),
efficiency of deterministic optimization and its accuracy is there are two different methods for the reliability assessment;
d ≤ d ≤ d , µ ≤ µX ≤ µ
L U L
X
U
X SORA algorithm are described.
where Eq. (5) has been used to transform each probabilistic An equivalent formulation of the general RBDO
constraint to an inequality between the actual reliability index formulation of Eq. (1), using the percentile formulation is
β and the target reliability index β t . The reliability index stated as [10,13,31]
min f (d, µ X , µ P ) (11)
β = −Φ −1 (FG (0)) is equivalently the minimum distance of a d, µX
point U on the limit state G (U ) = 0 from the origin of the s.t. Gi R (d, X, P) ≥ 0, i = 1,L, n
standard normal space. It is therefore, calculated from the where G R is the R-percentile of the constraint G (d, X, P) . It is
following reliability minimization problem
defined as,
β = min U (8)
U P (G (d, X, P)) ≥ G R ) = R (12)
s.t. G (U ) = 0 where R is the target reliability for the constraint. Fig. 1 shows
where the vector U represents the random variables in the a geometric interpretation of G R . It is clear that if G R ≥ 0 ,
standard normal space. P (G (d, X, P ) ≥ 0) ≥ R , Therefore, G R ≥ 0 provides an equivalent
Similarly, the PMA-based RBDO problem, which is deterministic expression of the probabilistic constraints in Eq.
practically the inverse of the RIA-based RBDO problem, is
(1). The R-percentile G R is evaluated using the PMA method
stated as [10-13]
min f (d, µ X , µ P )
of Eq. (10). After the MPP is calculated, the R-percentile is
d, µ X given by
s.t. G p = ( FG −1 (Φ (− β t )) ≥ 0 , i = 1,..., n (9) G R = G (d, X MPP , PMPP ) (13)
i i i
d ≤ d ≤ d , µ ≤ µX ≤ µ
L U L U Therefore, the optimization problem of Eq. (11) becomes
min f (d, µ X , µ P )
X X
(14)
where the performance measure G p is calculated from the d, µX
s.t U = βt . and X MPP , U MPP are the Most Probable Point for the i th
i i
As shown from Eqs (7) and (9), both the RIA and PMA- constraint in X and U spaces, respectively and σ is the vector
based RBDO formulations involve nested optimization loops, of standard deviations. Similarly, PMPP is the value of the
i
which may hinder on their computational efficiency and random parameters at the MPP of the i th constraint in the X
convergence properties. To improve the computational space.
efficiency, different optimization formulations have been
recently proposed that either decouple the two nested
Area= P[G ≥ G R ] = R
optimization loops [22-24] or even better, merge them in a
PDF of G
single optimization loop [25, 27] leading therefore, to
significant efficiency and convergence benefits. The work in
this paper presents a significant advancement of [27] in
developing a robust single-loop RBDO method.
G(U)
Figure 2. Schematic of SORA method; Opt: Deterministic
optimization; RA: Reliability assessment. G (U ) ≥ 0
∇G
Beta ∇H
3. SINGLE-LOOP METHOD FOR RBDO PROBLEMS A
In the traditional double-loop RBDO formulation, a
reliability optimization (inner loop) is performed when the ∇G u1
G (U) ≤ 0
design optimization (outer loop) calls for a probabilistic Decreasing Direction of G
constraint evaluation. This can drastically increase the B
∇H
computational cost. In this section, a single-loop RBDO
G (U ) = 0
algorithm is presented based on an equivalent deterministic Figure 3. Geometric explanation of optimal solution for one
optimization formulation, which eliminates the need for inner
active constraint.
reliability loops or sequential deterministic and reliability
loops. It also does not increase the number of design variables
It should be noted that in X space, the entire sphere must
as is the case with some other proposed single-loop algorithms be in the feasible domain which according to Eq. (17) is
[25,26]. It is an accurate and computationally very efficient defined by a set of non-negative constraints. The gradient of
RBDO method. It has the same accuracy with the double-loop
each constraint points inside the feasible domain. Also, the
approach and the number of required function evaluations is gradient of the entire hyper-sphere points outwards. Since the
comparable to that of a deterministic optimization.
whole hyper-sphere in X space must be in the feasible domain,
In principle, it converts the probabilistic optimization the gradients of a constraint and the corresponding beta hyper-
problem into an equivalent deterministic optimization problem
sphere must point in opposite directions. For this reason, the
by enforcing the Karush-Kuhn-Tucker optimality conditions
[35,36] of the reliability loop as a constraint of an equivalent Lagrange multiplier λ in Eq. (19) must be non-negative (i.e.
deterministic design optimization formulation. λ ≥ 0 ), indicating that the gradients of G (U) and H (U) are
Using the R-percentile formulation of Eq. (14), the collinear and they point in opposite directions. This is shown
RBDO problem can be expressed as, geometrically in Fig. 3 for one constraint in two dimensions.
feasible domain G (U) ≥ 0 . However, point B is the MPP. α i = σ ∗ ∇Gi X, P (d, Xi , Pi ) / || σ ∗ ∇Gi X, P (d, Xi , Pi ) ||
u2
G1 = 0 d L ≤ d ≤ dU , µ XL ≤ µ X ≤ µUX
and β t is the target reliability index for the ith constraint, α i
i
Decreasing
∇H is the normalized gradient of the ith constraint and σ is the
Direction Active standard deviation vector of random variables X and random
of Constraint 1 Constraint 1 parameters P.
A
∇ G1
In the single-loop RBDO formulation of Eq. (26), the
∇G2
u1 objective function is evaluated at the mean point d,µ X , µ P and
Decreasing
Direction
B Inactive the constraints are calculated at the d, X, P point. The
∇ H Constraint 2
of Constraint 2 relationship of Eqs (25) is used to evaluate the constraints
consistently with the values of the design variables. The
G2 = 0
single-loop method does not search for the MPP of each
Figure 4. Geometric explanation of optimal solution for two constraint at each iteration. Instead, the MPP’s of the active
constraints. constraints are correctly identified at the optimum. This
dramatically improves the efficiency of the proposed single-
Fig 4 shows a hypothetical RBDO problem with two loop method without compromising the accuracy.
constraints plotted in the U space. For simplicity, both
constraints are assumed to have the same target reliability and Initialize 0
d 0 , µ X , µ P , β, σ, lb, ub
therefore, the same beta circle. As the design optimization
(outer) loop progresses, the two constraints have a tendency to
Assign X 0 = µ X 0 , P 0 = µ P
move towards the beta circle. At the optimum of this
hypothetical case, the first constraint is tangent to the beta
circle and therefore, active; the second constraint is not active. Calculate αi 0 = σ ∗ ∇Gi ( X,P) (d0 , X0 , P0 ) / || σ ∗ ∇Gi (X, P) (d0 , X0 , P0 ) ||
For both constraints however, ∇G (U) and ∇H (U) are
collinear and point in opposite directions. Point A is the MPP k=0
for the first constraint while point B is not the MPP for the Calculate f (d , µ kX , µ P )
k
second constraint.
Considering that ∇H (U) = 2 * U , Eq. (19) yields
U = −[|| ∇G || /(2 * λ )] * (∇G / || ∇G ||) (20) No
µ kX Change?
where ∇G is the length of ∇G . Since the length of vector U
Yes, k=k+1
is equal to the beta hyper- sphere radius β t and ∇G / || ∇G || is
Calculate αi = σ ∗∇Gi(X,P) (d , Xi , Pik−1) / || σ ∗∇Gi(X,P) (dk , Xik−1Pik−1) ||
k k k −1
a unit vector, the positive quantity || ∇G || /(2 * λ ) in Eq. (20)
must be equal to β t . Therefore, Eq. (20) becomes
U = −βt ∗ α (21) Calculate Xi k = µXk − βt ∗ αi k ∗ σ, Pi k = µP − βt ∗ αi k ∗ σ
i i
where α = ∇ G U ( d, X, P ) / || ∇ G U ( d, X, P ) || (22)
is the constraint normalized gradient in U space. Calculate G i ( d k , X ik , P ik )
The transformation of X space to U space yields the
following relationships between X, P and U,
X = σ * U + µX , P = σ * U + µP . (23) No Is f Yes Stop
Also, using the chain rule, minimized?
∇GU (d, X, P)= σ * ∇GX,P (d, X, P) (24)
Combining Eqs (21) through (24) yields the following Figure 5. Flowchart of the single-loop RBDO method.
relationship between X, P and µ X , µ P ,
3.1. Single-Loop Method Flowchart
X = µ X − σ * βt ∗ α, P = µ P − σ * βt ∗ α (25) Fig. 5 shows the flowchart of the proposed single-
where α = σ ∗ ∇ G X, P ( d, X, P ) / || σ ∗ ∇ G X, P ( d, X, P ) || loop method. First, the initial point d 0 , µ 0X , µ P is specified as
Eqs (25) hold for each constraint of the RBDO well as the target reliability index vector β t for all constraints,
formulation of Eq. (17). the standard deviation vector σ for the random variables and
Using Eqs (25), the RBDO formulation of Eq. (17) is random parameters and the upper and lower bound vectors (ub
transformed to the following single-loop, equivalent and lb, respectively) for all deterministic and probabilistic
deterministic optimization problem design variables. The initial point d 0 , X0 , P 0 needed to evaluate
performing nested design optimization and reliability loops, it s.t. P(G j ( X) ≥ 0) ≥ R j j =1~ 3
solves an equivalent single-loop deterministic optimization 2
G1 ( X) = x1 * x2 / 20 − 1
problem. Therefore, its efficiency is vastly superior to existing
G2 ( X) = ( x1 + x2 − 5) 2 / 30 + ( x1 − x2 − 12) 2 / 120 − 1
double-loop approaches. It is also more efficient than the
2
decoupling RBDO methods [22-24] which rely on solving G3 ( X) = 80 /( x1 + 8 * x2 + 5) − 1
successive deterministic and reliability optimization problems. 0 ≤ µi ≤ 10 i =1~ 2
Furthermore, the single-loop method has the same accuracy
σ 1 = σ 2 = 0.3 β j = 3 for j=1,2,3
with the double-loop methods.
Beta G3
Opt. Circle 5
4 G3
Mean pt G1
6.5
gradient vector α 0 is calculated using Eq. (27). For the initial 6
constraint evaluation, three points X = (x1 , x 2 ) , one for each 5.5
5
constraint, are calculated using the relation X0 = µ0X − βt * α0 * σ . Single-Loop
4.5 Det. Opt
These three points are shown with open-circle symbols on the 4
initial β –circle. Fig. 6 shows the position of the β –circle 1 2 3 4 5
for the first three iterations. The center of each β –circle Iteration No.
indicates the value of the design vector µX = (µ1, µ2 ) . Also, on Figure 8. Comparison of single-loop method with
deterministic optimization.
each β –circle the three X = (x1, x2 ) points are indicated with
open-circle symbols. At the optimum, these points are the Fig. 8 and Table 1 illustrate the accuracy and efficiency
MPP’s of the corresponding active constraints. As shown, the of the proposed single-loop RBDO method. Fig. 8 compares
optimum µ X = (3.4391, 3.2864) has been practically reached the efficiency of the single-loop method against deterministic
after three iterations. Constraints G1 and G 2 are active and optimization. Both need four iterations to converge. The final
constraint G 3 is inactive. It must be noted that physically the value of the objective function is 5.1765 and 6.7255 for the
deterministic and single-loop methods, respectively. As
β –circle moves within the feasible domain defined by the indicated in Table 1, both the deterministic and the single-loop
three constraints, until it either becomes tangent to at least one methods required 19 function evaluations. In comparison, the
constraint (active constraint) without penetrating the fixed SORA and the DLP/PMA methods required 151 and 1566
boundaries of the feasible domain (constrained optimum) or function evaluations, respectively. In this study, the evaluation
the objective function is minimized without any constraints of the objective function and all constraints is considered as a
being active (unconstrained optimum). In the latter case, the single function evaluation. In this example, the efficiency of
β –circle is within the feasible domain without touching its the single-loop method is the same with that of deterministic
boundaries. optimization. In general, the efficiency of the single-loop
Fig. 7 shows the progress of the single-loop RBDO method is comparable to the deterministic optimization. It
method in the U-space for the 1st, 2nd and 4th iterations. The should be noted that the efficiency of any RBDO method can
algorithm converged in four iterations based on the specified not theoretically exceed the efficiency of the deterministic
optimization. The last two columns of Table 1 compare the
9.5
Det. DLP/ SINGLE DLP/ SINGLE
Obj. Function
SORA 9 Det. Opt
Opt. PMA LOOP PMA LOOP
8.5 Single-Loop (Beta=3)
Design x1 =5, Normal x 1 =3.5,Lognormal
8
DLP/PMA
Variables x 2 =5, Normal x 2 =3.5, Normal 7.5
is specified according to the EEVC side impact procedure. All s. t. P ( FAL ≤ 1KN ) ≥ R1
nodes of the moving barrier are assigned an initial velocity of P( Dlow ≤ 32cm) ≥ R 2
31 mph.
P ( Dmid ≤ 32cm) ≥ R3
P ( Dup ≤ 32cm) ≥ R4
P (VClow ≤ 0.32cm) ≥ R5
P (VCmid ≤ 0.32cm) ≥ R6
P (VCup ≤ 0.32cm) ≥ R7
P ( Fps ≤ 4.0 KN ) ≥ R8
P (VB − Pillar ≤ 9.9m / s ) ≥ R9
Figure 11. Finite element model for vehicle side impact P (Vdoor ≤ 15.69m / s ) ≥ R10
example. µ iL ≤ µ i ≤ µUi i =1~ 7
In side impact design, the increase of gage design and µ8 , µ9 = 0.345 or 0.192 (material properties)
variables tends to improve the dummy performance. However, µ10 , µ11 = 0.0 (barrier height and position)
the vehicle weight is simultaneously increased, which is where Ri (i = 1 ~ 10) are the desired reliabilities for each
undesirable. For this reason, an optimization problem is
formed by minimizing the vehicle weight subject to a number constraint, FAL is the dummy abdomen load, Dup , Dmid and Dlow
of safety constraints on the dummy according to the EEVC are the dummy upper rib, middle rib and lower rib deflections
procedure. They include HIC, abdomen load, rib deflection or and VCup , VC mid and VClow are the dummy upper chest, middle
V*C, and pubic symphysis force. chest and lower chest viscous criterion values, respectively.
Also, Fps is the dummy pubic symphysis force, V B − Pillar is the
Table 3. Description and range of design variables for
vehicle side impact example. velocity at the middle B-pillar position and V door is the B-
pillar velocity at door belt line. A 99.87% reliability ( β = 3 )
Random Design Variables &
Range is used for all ten constraints. All random variables and
Parameters
Description Minimum Nominal Maximum parameters are assumed normally distributed with standard
B-Pillar inner 0.5 1.0 1.5 deviations σ 1− 4,6,7 = 0.03 , σ 5 = 0.05 , σ 8,9 = 0.006 and σ 10,11 = 10.0 .
The deterministic optimization reduced the vehicle weight to
Thickness (mm)