Open Access
ARTICLE
On Hole Nucleation in Topology Optimization Using the Level Set Methods
Corresponding author, Email: smaws@nus.edu.sg.
Singapore-MIT Alliance, E4-04-10, 4 Engineering Drive3, Singapore 117576.
Department of Mechanical Engineering, National Univer-sity of Singapore, Singapore 119260.
Department of Mechanical and Automation Engineering,The Chinese University of Hong Kong, Shatin, NT, HongKong.
Computer Modeling in Engineering & Sciences 2007, 21(3), 219-238. https://doi.org/10.3970/cmes.2007.021.219
Abstract
Hole nucleation is an important issue not yet fully addressed in structural topology optimization using the level set methods. In this paper, a consistent and robust nucleation method is proposed to overcome the inconsistencies in the existing implementations and to allow for smooth hole nucleation in the conventional shape derivatives-based level set methods to avoid getting stuck at a premature local optimum. The extension velocity field is constructed to be consistent with the mutual energy density and favorable for hole nucleation. A negative extension velocity driven nucleation mechanism is established due to the physically meaningful driving force. An extension velocity filtering approach is developed to allow for nucleation of new holes at the sites where the material is ineffectively used while the ill-posed topology optimization problem can be regularized. To overcome the numerical instabilities caused by the level set evolution, the gradients of the level set function are kept bounded using a rescaling-based reinitialization scheme based on a global representation technique without moving the free boundary. Inconsistencies with the regularization and reinitialization techniques are eliminated and smooth nucleation of new holes becomes possible. The level set-based topology optimization would become more accurate and efficient. The success of the present method is demonstrated with the classical examples in minimum compliance design.Keywords
Cite This Article
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.