Skip to content
naulon

Not checkedNot checked for notices yet.

A consideration on robust design optimization problem through formulation of multiobjective optimization

Makoto ITO, Nozomu KOGISO, Taku HASEGAWA

Journal of Advanced Mechanical Design, Systems, and Manufacturing · 2018

doi:10.1299/jamdsm.2018jamdsm0058 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

The robust design optimization (RDO) problem is generally formulated as a weighted sum of the nominal objective function and the robust term. In the RDO problem, a deterministic optimum design is regarded as one of the local optima. However, this property is not well understood. Even though robust optimum designs are known to be significantly different from deterministic designs in certain cases, they are nearly identical in other cases, for reasons that are not intuitively understandable. This is due to the fact that the trade-off relationship between deterministic and robust optimum designs and the effects of uncertainty on the latter are not evaluated by the weighted sum approach. In this study, the properties of robust optimum designs are investigated by formulating the RDO problem as a multiobjective optimization problem, where the nominal value of the performance function and the worst value in the uncertainty region are adopted as the objective functions. The problem considered in this study is limited in that for simplicity, only the design variable is assumed to have uncertainty. That is, the mean value of the random variable is regarded as the design variable. The Pareto solutions are obtained by an evolutionary algorithm whereby the worst design in each individual during the evolutionary process is selected by a sampling method so that the approximation error may be avoided. Through simple numerical examples under several distribution types for random variables, the trade-off relationship between deterministic and robust optimum designs and the effects of uncertainty on the latter are investigated.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.