Structural Topology Design Optimization Using the Binary Bat Algorithm

Abstract

In this study, the binary bat algorithm (BBA) for structural topology optimization is implemented. The problem is to find the stiffest structure using a certain amount of material and some constraints using the bit-array representation method. A new filtering algorithm is proposed to make BBA find designs with no separated objects, no checkerboard patterns, less unusable material, and higher structural performance. A volition penalty function for topology optimization is also proposed to accelerate the convergence toward the optimal design. The main effect of using the BBA lies in the fact that the BBA is able to handle a large number of design variables in comparison with other well-known metaheuristic algorithms. Based on the numerical results of four benchmark problems in structural topology optimization for minimum compliance, the following conclusions are made: (1) The BBA with the proposed filtering algorithm and penalty function are effective in solving large-scale numerical topology optimization problems (fine finite elements mesh). (2) The proposed algorithm produces solid-void designs without gray areas, which makes them practical solutions that are applicable in manufacturing.