An Improved Beetle Antennae Search Algorithm
- 35 Downloads
The Beetle Antennae Search Algorithm has fast convergence speed and global optimization ability in low-dimensional function optimization, but for multi-dimensional functions, the convergence speed and optimization precision of the BAS is relatively low. To overcome these shortcomings, this paper proposes an Improved Beetle Antennae Search Algorithm (IBAS). There are mainly two modifications for BAS. First, in order to accelerate the convergence of the algorithm, an adaptive factor is included. Second, the simulated annealing process is used to enable the algorithm to jump out of the local optimum. Two standard test functions are used for testing and compared with the BAS, BSAS, and SA algorithms. The simulation results show that IBAS has better performance in multi-dimensional function optimization.
KeywordsBeetle Antennae search algorithm Multi-dimensional Function optimization
- 1.Jiang X, Li S. BAS: Beetle antennae search algorithm for optimization problems. arXiv:1710.10724v1; 2017.
- 2.Zou D, Chen P, Liu K. Indoor location algorithm based on the search optimization of the Beetle. J Hubei Univ Nationalities (Nat Sci Ed). 2018;36(04):70–74+98.Google Scholar
- 4.Kirkpatrick S, Vecchi MP. Optimization by simulated annealing. Spin glass theory and beyond: An introduction to the Replica method and its applications; 1987.Google Scholar