β-Hill Climbing Optimizer (βHC)

β-Hill climbing: an exploratory local search optimization algorithm. This is an enhanced version of the Hill climbing algorithm

Hill climbing method is an optimization technique that is able to build a search trajectory in the search space until reaching the local optima. It only accepts the uphill movement which leads it to easily get stuck in local optima. Several extensions to hill climbing have been proposed to overcome such problem such as Simulated Annealing, Tabu Search. In this paper, an extension version of hill climbing method has been proposed and called β-hill climbing. A stochastic operator called β-operator is utilized in hill climbing to control the balance between the exploration and exploitation during the search.

This is the source codes of the paper: Al-Betar, Mohammed Azmi. "β-Hill climbing: an exploratory local search." Neural Computing and Applications 28, no. 1 (2017): 153-168.