Using QIGSO with steepest gradient descent strategy to direct orbits of chaotic systems
by Zhuanghua Zhu
International Journal of Computational Science and Engineering (IJCSE), Vol. 7, No. 2, 2012

Abstract: As a new swarm intelligent algorithm, group search optimiser (GSO) attracts many scholars' attention. However, its performance is not good. To overcome this shortcoming, a new group search optimiser based on quadratic interpolation method (QIGSO) is proposed by Yao et al. (2011) in which one local optimum is estimated. In this paper, a new strategy, steepest gradient descent strategy is incorporated into the methodology of QIGSO to enhance the exploitation capability. This new variant of QIGSO (QIGSO-SDO) provides little estimation error, and obtains a better performance near the local optima. In this paper, QIGSO-SDO is employed to solve the directing orbits of chaotic systems, simulation results show this new variant increases the performance significantly when compared with the standard version of group search optimiser.

Online publication date: Mon, 22-Sep-2014

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 Computational Science and Engineering (IJCSE):
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