An enhanced firefly algorithm for function optimisation problems Online publication date: Thu, 31-Jul-2014
by Xiaoyu Lin; Yiwen Zhong; Hui Zhang
International Journal of Modelling, Identification and Control (IJMIC), Vol. 18, No. 2, 2013
Abstract: An enhanced firefly algorithm (EFA) is proposed to improve the performance of the standard firefly algorithm (FA). After analysing the impacts of the attraction and the randomisation parameter in FA's movement, we introduce three improvement strategies. First, a virtual standard space is constructed to eliminate the negative influence generated by the long distance between two fireflies. Second, the randomisation parameter in FA's movement is replaced by a stochastic factor, which is integrated into FA's attractiveness to produce adaptive randomisation. Finally, a fine-grained evaluation strategy is applied to deal with the negative mutual influence among different dimensions. The experiments carried on classic and shifted benchmark functions show that the proposed EFA performs significantly better than standard FA in terms of both convergent speed and solution precision.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Modelling, Identification and Control (IJMIC):
Login with your Inderscience username and 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