Beetle Antennae Search Algorithm Based on PSO and Fibonacci

DOI

10.2991/cnci-19.2019.38How to use a DOI?

Keywords

Beetle antennae search algorithm, Fibnacci algorithm, PSO.

Abstract

Beetle Antennae Search Algorithm (BAS) is simple and efficient, but is not stable. The calculation precision is not high and the algorithm is easy to get into local optimum. To overcome these defects, the idea of particle swarm is used to search and traditional Fibnacci method to determine the search step length of each set up, so as to propose the PSO-Fibonacci-BAS algorithm. In this paper, single - peak and multi - peak function are used to test the performance of PSO-Fibonacci-BAS and three evaluation criteria are established to evaluate the performance of the algorithm. The simulation results show that PSO-Fibonacci-BAS is better than PSO and BAS. The algorithm not only has strong stability, but also has high precision.

Copyright

© 2019, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Hongmei Wang
AU  - Zhibin Liu
AU  - Dan Qu
PY  - 2019/05
DA  - 2019/05
TI  - Beetle Antennae Search Algorithm Based on PSO and Fibonacci
BT  - Proceedings of the 2019 International Conference on Computer, Network, Communication and Information Systems (CNCI 2019)
PB  - Atlantis Press
SP  - 259
EP  - 263
SN  - 2352-538X
UR  - https://doi.org/10.2991/cnci-19.2019.38
DO  - 10.2991/cnci-19.2019.38
ID  - Wang2019/05
ER  -