An enhanced search strategy for firefly algorithm
by Wenjun Wang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 11, No. 1, 2016

Abstract: The Firefly Algorithm (FA) is a recently proposed meta-heuristic which is inspired by the social behaviour of fireflies. Though FA has shown good performance on many optimisation problems, it easily falls into local optima in solving complex optimisation problems. To tackle this issue, this paper presents a new FA variant by employing an enhanced search strategy. Experiments are carried out on ten well-known benchmark functions. Computational results show that the proposed approach outperforms the standard FA and some recently published FA variants.

Online publication date: Wed, 28-Sep-2016

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 Wireless and Mobile Computing (IJWMC):
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