Hybrid whale optimisation and β-hill climbing algorithm for continuous optimisation problems Online publication date: Tue, 26-Jan-2021
by Bilal H. Abed-alguni; Ahmad F. Klaib
International Journal of Computing Science and Mathematics (IJCSM), Vol. 12, No. 4, 2020
Abstract: The whale optimisation algorithm (WOA) is an efficient optimisation algorithm inspired by the bubble-net hunting strategy of humpback whale. As any optimisation algorithm, WOA may prematurely converge to suboptimal solutions. This paper introduces a new hybrid WOA algorithm (WOABHC) that efficiently combines the WOA algorithm with the β-hill climbing algorithm (BHC) to control the diversity of the search space. The β-hill climbing algorithm is called at each iteration of WOABHC based on the probability function used in simulated annealing to reduce the number of computations required to achieve a good solution. WOABHC was tested and compared to well-known optimisation algorithms using 25 standard benchmark functions. The experimental results confirm the efficiency of the proposed method in improving the accuracy of the results compared to WOA and other well-known optimisation algorithms.
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 Computing Science and Mathematics (IJCSM):
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