An improved firefly algorithm for numerical optimisation
by Xiangqin Xiang
International Journal of Computing Science and Mathematics (IJCSM), Vol. 6, No. 2, 2015

Abstract: Firefly algorithm (FA) is a recently proposed meta-heuristic optimisation technique, which has shown good performance on many optimisation problems. In the original FA, each firefly is attracted by any other brighter firefly (better fitness value). By the attraction, fireflies maybe moved to better positions. However, the attraction does not guarantee whether a firefly is moved to a better position. Sometimes, the attraction may move a firefly to a worse position. Therefore, the search of firefly is oscillated during the evolution. In this paper, we present an improved firefly algorithm (IFA), which employs a greedy selection method to guarantee that a firefly is not moved to worse positions. To verify the performance of IFA, a set of well-known benchmark functions are used in the experiments. Experimental results show that the IFA achieves better results than the original FA.

Online publication date: Sun, 17-May-2015

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