Bat algorithm with Gaussian walk
by Xingjuan Cai; Lei Wang; Qi Kang; Qidi Wu
International Journal of Bio-Inspired Computation (IJBIC), Vol. 6, No. 3, 2014

Abstract: Bat algorithm is a novel branch of evolutionary computation. Although there are several research papers that focus on this new algorithm, however, few of them concerns the high-dimensional numerical problems. In this paper, a new variant called bat algorithm with Gaussian walk (BAGW) is proposed aiming to solve this problem. In this variant, a Gaussian walk is employed in the local turbulence instead of the original uniform walk to improve the local search capability. Furthermore, to keep the high exploitation pressure, the velocity update equation is also changed. Finally, to increase the population diversity, the frequency is dominated by each dimension in our modification, as well as it is depended on the different bat in the standard version. To test the performance of our variant, four famous un-constraint numerical benchmarks are employed, and test on different dimensional cases, simulation results show our modification is effective.

Online publication date: Sat, 27-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 Bio-Inspired Computation (IJBIC):
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