An Improved Beetle Antennae Search Algorithm Based on the Elite Selection Mechanism and the Neighbor Mobility Strategy for Global Optimization Problems

Abstract

Aiming at the shortcoming that the basic beetle antennae search algorithm fails to consider differences between individuals and the dynamic information in the searching process, this paper proposed a new beetle antennae search algorithm based on the elite selection mechanism and the neighbor mobility strategy. The elite selection mechanism will be used to weaken beetles having bad performances and generate new beetles to ensure diversities and abilities in the whole population. The neighbor mobility strategy will guide the algorithm to open up a wider searching area to ensure that individuals having good positions own a chance to infect individuals with poor performances. To verify the searching ability and the optimization speed of the proposed algorithm in this paper, different testing functions were selected for numerical testing experiments, and the iteration figures, box plots, and searching path figures were given. The experimental results showed that the proposed algorithm in this paper was superior to the original algorithm in the solving accuracy, the convergence speed, and the stability.

Keywords

• Beetle antennae search algorithm
• numerical problems
• global optimization