Convergence analysis of beetle antennae search algorithm and its applications

Abstract

In this paper, we focuses on the theoretical analysis on the convergence of the beetle antennae search (BAS) algorithm. For the first time, we prove that the BAS algorithm is convergent with probability 1, which provides some insights about why the BAS algorithm works and also brings us some ideas about how to improve the BAS algorithm in the future. We also test the performance of the BAS algorithm via some representative benchmark functions. Meanwhile, some applications of the BAS algorithm are also presented, showing the advantages of the algorithm over other algorithms.