Further elaborations on topology optimization via sequential integer programming and Canonical relaxation algorithm and 128-line MATLAB code
- 187 Downloads
This paper provides further elaborations on discrete variable topology optimization via sequential integer programming and Canonical relaxation algorithm. Firstly, discrete variable topology optimization problem for minimum compliance subject to a material volume constraint is formulated and approximated by a sequence of discrete variable sub-programming with the discrete variable sensitivity. The differences between continuous variable sensitivity and discrete variable sensitivity are discussed. Secondly, the Canonical relaxation algorithm designed to solve this sub-programming is presented with a discussion on the move limit strategy. Based on the discussion above, a compact 128-line MATLAB code to implement the new method is included in Appendix 1. As shown by numerical experiments, the 128-line code can maintain black-white solutions during the optimization process. The code can be treated as the foundation for other problems with multiple constraints.
KeywordsDiscrete variable topology optimization Sequential approximate programming (SAP) Canonical relaxation algorithm MATLAB
This work is supported by the National Natural Science Foundation of China (grant number 11821202).
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
- Gao DY (2007) Solutions and optimality to box constrained nonconvex minimization problems. J Ind Manag Optim 3(2):293–304Google Scholar
- Munk D (2018) A bi-directional evolutionary structural optimization algorithm for mass minimization with multiple structural constraints. Int J Numer Methods Eng 118:93–120. https://doi.org/10.1002/nme.6005