Continuum topology optimization with non-probabilistic reliability constraints based on multi-ellipsoid convex model

Publication Type:
Journal Article
Structural and Multidisciplinary Optimization, 2009, 39 (3), pp. 297 - 310
Issue Date:
Filename Description Size
Thumbnail2011000637OK.pdf543.92 kB
Adobe PDF
Full metadata record
Using a quantified measure for non-probab ilistic reliability based on the multi-ellipsoid convex model, the topology optimization of continuum structures in presence of uncertain-but-bounded parameters is investigated. The problem is formulated as a double-loop optimization one. The inner loop handles evaluation of the non-probabilistic reliability index, and the outer loop treats the optimum material distribution using the results from the inner loop for checking feasibility of the reliability constraints. For circumventing the numerical difficulties arising from its nested nature, the topology optimization problem with reliability constraints is reformulated into an equivalent one with constraints on the concerned performance. In this context, the adjoint variable schemes for sensitivity analysis with respect to uncertain variables as well as design variables are discussed. The structural optimization problem is then solved by a gradient-based algorithm using the obtained sensitivity. In the present formulation, the uncertain-but bounded uncertain variations of material properties, geometrical dimensions and loading conditions can be realistically accounted for. Numerical investigations illustrate the applicability and the validity of the present problem statement as well as the proposed numerical techniques. The computational results also reveal that non-probabilistic reliability-based topology optimization may yield more reasonable material layouts than conventional deterministic approaches. The proposed method can be regarded as an attractive supplement to the stochastic reliability-based topology optimization. © 2008 Springer-Verlag.
Please use this identifier to cite or link to this item: