Title: An improved firefly algorithm based on probabilistic attraction

Authors: Gan Yu

Addresses: School of Information Engineering, Fuyang Normal University, Fuyang, 236037, China

Abstract: Firefly algorithm (FA) is an efficient optimisation tool, which has been widely applied to various optimisation problems. However, the standard FA still has some drawbacks. For example, the computational time complexity of FA is higher than other swarm intelligence algorithms. Recently, Wang et al. (2016b) designed a random attraction model to reduce the computational time complexity. Based on the random attraction model, we propose a probabilistic attraction model. To test the performance of the proposed approach (PAFA), several benchmark functions are utilised in the experiments. Computational results show that the proposed strategy can effectively improve the performance of FA.

Keywords: firefly algorithm; probabilistic attraction; numerical optimisation; random attraction; global optimisation; metaheuristics; swarm intelligence.

DOI: 10.1504/IJCSM.2016.081701

International Journal of Computing Science and Mathematics, 2016 Vol.7 No.6, pp.530 - 536

Received: 05 Jul 2016
Accepted: 26 Aug 2016
Published online: 20 Jan 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article