General central firefly algorithm based on different learning time Online publication date: Tue, 14-Nov-2017
by Peiwu Li; Jia Zhao; Zhifeng Xie; Wenjing Li; Li Lv
International Journal of Computing Science and Mathematics (IJCSM), Vol. 8, No. 5, 2017
Abstract: Firefly algorithm is a bionic random algorithm for solving complex optimisation problems. Any firefly will be attracted to other better fireflies to complete the population evolution. In this method, the better fireflies only show the advantages of them, but do not represent that of swarm. In order to enhance information exchange between the swarms, different learning time of the general central particle is embedded into the particle update phase. So, we propose the general central firefly algorithm based on different learning time. Correspondingly, three variants of general central FA are generated, namely, the algorithms based on one-to-one (OO) learning time, one-to-all (OA) learning time and all-to-all (AA) learning time. Experiments are tested on 12 benchmark functions. The results show that the optimisation performance of three algorithms are better than that of the standard FA. OOFA algorithm has the best optimisation performance.
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 Computing Science and Mathematics (IJCSM):
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook