A unified aggregation and relaxation approach for stress-constrained topology optimization

Journal Article (2017)
Author(s)

A Verbart (Royal Netherlands Aerospace Centre NLR, Technical University of Denmark (DTU))

Matthijs Langelaar (TU Delft - Computational Design and Mechanics)

Fred van van Keulen (TU Delft - Computational Design and Mechanics)

Research Group
Computational Design and Mechanics
Copyright
© 2017 A. Verbart, Matthijs Langelaar, A. van Keulen
DOI related publication
https://doi.org/10.1007/s00158-016-1524-0
More Info
expand_more
Publication Year
2017
Language
English
Copyright
© 2017 A. Verbart, Matthijs Langelaar, A. van Keulen
Research Group
Computational Design and Mechanics
Issue number
2
Volume number
55
Pages (from-to)
663 - 679
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

In this paper, we propose a unified aggregation and relaxation approach for topology optimization with stress constraints. Following this approach, we first reformulate the original optimization problem with a design-dependent set of constraints into an equivalent optimization problem with a fixed design-independent set of constraints. The next step is to perform constraint aggregation over the reformulated local constraints using a lower bound aggregation function. We demonstrate that this approach concurrently aggregates the constraints and relaxes the feasible domain, thereby making singular optima accessible. The main advantage is that no separate constraint relaxation techniques are necessary, which reduces the parameter dependence of the problem. Furthermore, there is a clear relationship between the original feasible domain and the perturbed feasible domain via this aggregation parameter.

Files

Postprint.pdf
(pdf | 4.22 Mb)
- Embargo expired in 06-07-2017
License info not available