期刊
STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION
卷 61, 期 1, 页码 411-431出版社
SPRINGER
DOI: 10.1007/s00158-019-02396-3
关键词
Discrete variable topology optimization; Sequential approximate programming (SAP); Canonical relaxation algorithm; MATLAB
资金
- National Natural Science Foundation of China [11821202]
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-lineMATLAB 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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据