Bat algorithm with Gaussian walk for directing orbits of chaotic systems
by Xingjuan Cai; WuZhao Li; Lei Wang; Qi Kang; Qidi Wu; Xiaonan Huang
International Journal of Computing Science and Mathematics (IJCSM), Vol. 5, No. 2, 2014

Abstract: Bat algorithm with Gaussian walk (BAGW) is a new variant of bat algorithm aiming to improve the computational efficiency. In BAGW, a Gaussian walk is employed in the local turbulence instead of the original uniform walk, so that the search efficiency of exploitation capability is controllable. Furthermore, to keep the high exploitation pressure, the velocity update equation is also changed. In this paper, BAGW is applied to solve the directing orbits of chaotic systems. To test its performance, the standard version bat algorithm and bat algorithm with Levy flight are employed to compare, simulation results show BAGW is superior to other two algorithms.

Online publication date: Sat, 20-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 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