Firefly algorithm with dynamic attractiveness model and its application on wireless sensor networks
by Jing Wang
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 13, No. 3, 2017

Abstract: Firefly algorithm (FA) is a new population-based meta-heuristic algorithm which has outstanding performance on many optimisation problems. However, in standard FA, the attractiveness quickly approaches a constant in the middle period of the iterations. It may be very detrimental to the search ability of the algorithm. So we propose a new variant FA (DFA) with a dynamic attractiveness model which can linearly adjust the rate of change of attractiveness as the number of iterations grows. Thirteen well-known benchmark functions are used to verify the performance of our proposed method; the computational results show that DFA is more efficient than many other FA algorithms. We also successfully used DFA to solve the wireless sensor network node distribution optimisation problem; the results of the coverage statistics further validate the effectiveness of the proposed algorithm.

Online publication date: Mon, 11-Dec-2017

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