Shuffled frog-leaping algorithm using elite opposition-based learning
by Jia Zhao; Li Lv
International Journal of Sensor Networks (IJSNET), Vol. 16, No. 4, 2014

Abstract: Shuffled frog-leaping algorithm (SFLA) has been shown that it can yield good performance for solving various optimisation problems. However, it tends to suffer from premature convergent when solving complex problems. This paper presents an effective approach, called SFLA using elite opposition-based learning (EOLSFLA), which employs elite population to overcome the problems through adopting opposition-based learning to generate opposite solution, increasing the capability of neighbourhood search and enhancing the local exploitation ability. At the same time, to improve the learning ability of the worst population in a memeplex, a new frog-leaping rule is proposed, in which the worst population can learn from other population in the memeplex to reinforce the global space-exploration ability. Experiments are conducted on a set of well-known benchmark functions to verify the performance of EOLSFLA, comparing with other standard swarm intelligence algorithms, opposition-based learning algorithms and improved SFLA, the results demonstrate promising performance of the new method EOLSFLA on convergence velocity and precision.

Online publication date: Mon, 26-Jan-2015

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 Sensor Networks (IJSNET):
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