A modified bat algorithm with torus walk for solving global optimisation problems Online publication date: Mon, 16-Mar-2020
by Waqas Haider Bangyal; Jamil Ahmed; Hafiz Tayyab Rauf
International Journal of Bio-Inspired Computation (IJBIC), Vol. 15, No. 1, 2020
Abstract: Bat algorithm (BA) has been widely used to solve the diverse kinds of optimisation problems. In accordance with the optimisation problems, balance between the two major components: exploitation and exploration, plays a significant role in meta-heuristic algorithms. Several researchers have worked on the performance for the improvement of these algorithms. BA faces one of the major issues in high dimensions. In our work, we proposed a new variant of BA by introducing the torus walk (TW-BA) to solve this issue. To improve the local search capability instead of using the standard uniform walk, torus walk is incorporated in this paper. The simulation results performed on 19 standard benchmark functions depicts the efficiency and effectiveness of TW-BA compared with the traditional BA, directional bat algorithm, particle swarm optimisation, cuckoo search, harmony search algorithm, differential evolution and genetic algorithm. The promising experimental result suggests the superiority of proposed technique.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook