![]() |
Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 83
PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL STRUCTURES TECHNOLOGY Edited by: B.H.V. Topping, G. Montero and R. Montenegro
Paper 204
Bias-Specified Robust Design Optimization: An Alternative Approach G. Steenackers and P. Guillaume
Acoustics & Vibration Research Group, Department of Mechanical Engineering, VUB University Brussels, Belgium Full Bibliographic Reference for this paper
G. Steenackers, P. Guillaume, "Bias-Specified Robust Design Optimization: An Alternative Approach", in B.H.V. Topping, G. Montero, R. Montenegro, (Editors), "Proceedings of the Eighth International Conference on Computational Structures Technology", Civil-Comp Press, Stirlingshire, UK, Paper 204, 2006. doi:10.4203/ccp.83.204
Keywords: optimization, robust design, regression techniques.
Summary
This paper discusses an existing robust optimization approach,
suggested and applied in the work of the authors Shin et al.
[1], and presents an alternative robust optimization
approach. Shin et al. suggest an optimization model, using
Lagrange multipliers to combine both constraints and slack
variables to change the inequality constraints to equality
constraints. The cost function used, proposed by the authors,
consists of minimizing the variance (
![]() ![]() ![]() ![]()
Let
with ![]() ![]() ![]() ![]()
The optimization problem is solved by using a numerical regression
technique.
For solving the generalized least squares problem, one needs to
specify three initial design parameter value pairs where the
correct value of the updating parameter is situated in between
[4]. The least squares problem is solved with the
boundary values used as starting values. A regression algorithm is used
to calculate the regression coefficients of the interpolation
polynomials. The difference in this alternative optimization
approach is the fact that the mean squared error is minimized by
using a cost function consisting of both the process variance and
the difference between process mean and process target. In the
optimization approach described in [1] only the variance
was minimized, taking into account the extra inequality constraint
that the process mean must be situated in a region around the
process target, pre-defined by the
The generalized robust optimization approach, minimizing the mean
squared error of both process mean deviation and variance, will
have a mean value closer to the process target value for almost
the same variance value, reached with the original robust
optimization approach. The reason for this better optimization
result is the fact that the generalized optimization approach
minimizes the mean square error of ( References
purchase the full-text of this paper (price £20)
go to the previous paper |
|