Improving firefly algorithm using hybrid strategies
by Gan Yu; Yingying Feng
International Journal of Computing Science and Mathematics (IJCSM), Vol. 9, No. 2, 2018

Abstract: In this paper, we present a new firefly algorithm (FA) by using hybrid strategies to obtain a good optimisation performance. The proposed approach, namely HFA, employs three strategies. First, an adaptive parameter method is utilised to dynamically changing the step factor. Second, HFA uses a modified search strategy and eliminates the concept of attractiveness. So, HFA does not include two parameters, absorption coefficient and initial attractiveness. Third, a probabilistic attraction model is used to replace the original full attraction model. Experiments on some benchmark problems show that HFA is superior to mimetic FA (MFA) and probabilistic attraction-based FA (PAFA).

Online publication date: Mon, 14-May-2018

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