An improved firefly algorithm based on probabilistic attraction
by Gan Yu
International Journal of Computing Science and Mathematics (IJCSM), Vol. 7, No. 6, 2016

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.

Online publication date: Fri, 20-Jan-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com