Topology Optimization of Continuum Structures Based on Binary Hunter-Prey Optimization Algorithm

Abstract

According to BESO’s principle of binarizing continuous design variables and the excellent performance of the standard HPO algorithm in terms of solving continuous optimization problems, a discrete binary Hunter-prey optimization algorithm is introduced to construct an efficient topology optimization model. It was used to solve the problems that the BESO method of topology optimization has, such as easily falling into the local optimal value and being unable to obtain the optimal topology configuration; the metaheuristic algorithm was able to solve the topology optimization model’s low computational efficiency and could easily produce intermediate elements and unclear boundaries. Firstly, the BHPO algorithm was constructed by discrete binary processing using the s-shape transformation function. Secondly, BHPO-BESO topology optimization theory was established by combining the BHPO algorithm with BESO topology optimization. Using the sensitivity information of the objective function and the updated principle of the meta-heuristic of the BHPO algorithm, a semi-random search for the optimal topology configuration was carried out. Finally, numerical simulation experiments were conducted by using the three typical examples of the cantilever beam, simply supported beam, and clamping beam as optimization objects and the results were compared with the solution results of BESO topology optimization. The experimental results showed that compared with BESO, BHPO-BESO could find the optimal topology configuration with lower compliance and maximum stiffness, and it has higher computational efficiency, which can solve the above problems.

Keywords

• hunter–prey optimization algorithm
• discrete binary algorithm
• topology optimization
• BESO