Opposition-based quantum firework algorithm for continuous optimisation problems
by Hongyuan Gao; Chenwan Li
International Journal of Computing Science and Mathematics (IJCSM), Vol. 6, No. 3, 2015

Abstract: A novel intelligence algorithm for continuous optimisation problem is proposed in this paper, termed as opposition-based quantum firework algorithm (OQFA). The proposed OQFA combines fireworks algorithm (FA) and two improved operators: opposition-based learning and quantum computing theory. The opposition-based learning operator can accelerate the convergence rate of algorithm by retaining the better solution, and the quantum computing theory can ameliorate the capability of searching and enhance the exploration efficiency of the solution space. Since OQFA has the features of both opposition-based learning and quantum computing, it has a high possibility to find a global optimum and avoids premature convergence. Experimental results on five test functions show that OQFA outperforms cultural algorithm (CA), particle swarm optimisation (PSO) and FA in terms of convergence rate and convergence accuracy.

Online publication date: Mon, 08-Jun-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 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