Two New Beetle Antennae Search (BAS) Algorithms and Their Comparative Investigation

Abstract

The Beetle Antennae Search (BAS) algorithm is a meta-heuristic search algorithm, which has efficient search capabilities. This paper presents two different variant algorithms based on the BAS algorithm, which are the BAS with fitness value (BASF) algorithm and BAS with local fast search (BASL) algorithm. The test results of 23 benchmark functions will be used to verify the reliability and accuracy of these algorithm. These benchmark functions include unimodal and multimodal high-dimensional functions, as well as fixed-dimensional multimodal functions. The test results show that the improved algorithm can search for the optimal solution globally and accurately with its own search strategy without environment parameters. Stability and accuracy are significantly improved while the calculation time does not change much.