Bat algorithm with Weibull walk for solving global optimisation and classification problems Online publication date: Fri, 29-May-2020
by Hafiz Tayyab Rauf; Muhammad Hadi; Abdur Rehman
International Journal of Bio-Inspired Computation (IJBIC), Vol. 15, No. 3, 2020
Abstract: Bat algorithm (BA) becomes the most widely employed meta-heuristic algorithm to interpret the diverse kind of optimisation and real-world classification problems. BA suffers from one of the influential challenges called local minima. In this study, we carry out two modifications in the original BA and proposed a modified variant of BA called bat algorithm with Weibull walk (WW-BA) to solve the premature convergence issue. The first modification involves the introduction of Weibull descending inertia weight for updating the velocity of bats. The second modification approach updates the local search strategy of BA by replacing the Random walk with the Weibull Walk. The simulation performed on 19 standard benchmark functions represent the competence and effectiveness of WW-BA compared to the state of the art techniques. The proposed WWBA is also examined for classification problem. The empirical results reveal that the proposed technique outperformed the classical techniques.
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