Sequential algorithms for structural design optimization under tolerance conditions

Abstract

A deterministic optimization usually ignores the effects of uncertainties in design variables or design parameters on the constraints. In practical applications, it is required that the optimum solution can endure some tolerance so that the constraints are still satisfied when the solution undergoes variations within the tolerance range. An optimization problem under tolerance conditions is formulated in this article. It is a kind of robust design and a special case of a generalized semi-infinite programming (GSIP) problem. To overcome the deficiency of directly solving the double loop optimization, two sequential algorithms are then proposed for obtaining the solution, i.e. the double loop optimization is solved by a sequence of cycles. In each cycle a deterministic optimization and a worst case analysis are performed in succession. In sequential algorithm 1 (SA1), a shifting factor is introduced to adjust the feasible region in the next cycle, while in sequential algorithm 2 (SA2), the shifting factor is replaced by a shifting vector. Several examples are presented to demonstrate the efficiency of the proposed methods. An optimal design result based on the presented method can endure certain variation of design variables without violating the constraints. For GSIP, it is shown that SA1 can obtain a solution with equivalent accuracy and efficiency to a local reduction method (LRM). Nevertheless, the LRM is not applicable to the tolerance design problem studied in this article.

Keywords:

• structural design optimization
• tolerance conditions
• sequential algorithms
• robust design
• GSIP

Funding

This work is supported by the Natural Science Foundation of China [grant number 10772070]; National Basic Research Program of China [grant number 2011CB013800]; PhD Programs Foundation of the Ministry of Education of China [grant number 20070487064].