An improved firefly algorithm hybrid with fireworks

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Firefly algorithm (FA) is a global optimization algorithm with simple, less parameter and faster convergence speed. However, the FA is easy to fall into local optimum, and the solution accuracy of the FA is lower. In order to overcome these problems. An improved Firefly algorithm hybrid with Fireworks (FWFA) is proposed in this paper. Because the local search ability of the fireworks algorithm’s search strategy is strong, we introduce the fireworks algorithm neighborhood search operator of the fireworks algorithm into the firefly algorithm to improve the local search ability of the Firefly algorithm. Through the simulation and analysis of 28 benchmark functions, verify the effectiveness and reliability of the new algorithm. The experimental results show that the new algorithm has excellent search ability in solving unimodal functions and multimodal functions.

Cite

CITATION STYLE

APA

Wang, X., Peng, H., Deng, C., Li, L., & Zheng, L. (2019). An improved firefly algorithm hybrid with fireworks. In Communications in Computer and Information Science (Vol. 986, pp. 27–37). Springer Verlag. https://doi.org/10.1007/978-981-13-6473-0_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free