z-logo
Premium
A level set approach for topology optimization with local stress constraints
Author(s) -
Emmendoerfer Hélio,
Fancello Eduardo Alberto
Publication year - 2014
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.4676
Subject(s) - topology optimization , mathematical optimization , minification , context (archaeology) , constraint (computer aided design) , sequence (biology) , benchmark (surveying) , set (abstract data type) , regularization (linguistics) , mathematics , level set method , topology (electrical circuits) , computer science , finite element method , engineering , structural engineering , geometry , artificial intelligence , segmentation , combinatorics , image segmentation , programming language , paleontology , genetics , geodesy , biology , geography
SUMMARY The purpose of this work is to present a level set‐based approach for the structural topology optimization problem of mass minimization submitted to local stress constraints. The main contributions are threefold. First, the inclusion of local stress constraints by means of an augmented Lagrangian approach within the level set context. Second, the proposition of a constraint procedure that accounts for a continuous activation/deactivation of a finite number of local stress constraints during the optimization sequence. Finally, the proposition of a logarithmic scaling of the level set normal velocity as an additional regularization technique in order to improve the minimization sequence. A set of benchmark tests in two dimensions achieving successful numerical results assesses the good behavior of the proposed method. In these examples, it is verified that the algorithm is able to identify stress concentrations and drive the design to a feasible local minimum. Copyright © 2014 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here