An improved beetle swarm antennae search algorithm based on multiple operators

The beetle antennae search algorithm (BAS) is inspired by the search behavior of long-horned beetles and is widely used in optimization problems. However, in the typical BAS algorithm, there are problems such as the insufficient optimization ability of beetle individuals and the lack of consideration of historical dynamic information in the algorithm search process, resulting in sufferings from local optimum, low diversity, and imbalanced utilization, etc. To solve these problems, an improved beetle swarm antennae search algorithm based on multiple operators, dubbed MO-BSAS, is proposed. First, the elite opposition-based learning is used to initialize the beetle population, which improves the population diversity and optimization ability of the algorithm; then, the Lévy Flight strategy is used to improve the traditional beetle moving operator. In addition, a multi-operator search strategy determined by the damped sinusoidal probability factor is designed to balance the exploitation and exploration capabilities of the algorithm and speed up its convergence. The MO-BSAS algorithm is compared with BSA and 8 popular or state-of-the-art smart algorithms under 14 different benchmark functions, and the experimental results show that the MO-BSAS algorithm has a shorter convergence time and better convergence accuracy than the algorithms compared, which verifies the effectiveness of the improved algorithm.