This paper considers the general multiple load structural topology design problems in the framework of the PLATO-N project. The problems involve a large number of discrete design variables and were modeled as a non-convex mixed 0–1 program. For the class of problems considered, a global optimization method based on the branch-and-cut concept was developed and implemented. In the method a large number of continuous relaxations were solved. We also present an algorithm for generating cuts to strengthen the quality of the relaxations. Several heuristics were also investigated to obtain efficient algorithms. The branch and cut method is used to solve benchmark examples which can be used to validate other methods and heuristics.
|Series||PLATO-N Public Reports|
- Topology optimization
- Stress constraints
- Branch and cut