Adaptive \(\beta -\)hill climbing for optimization

In this paper, an adaptive version of \(\beta -\)hill climbing is proposed. In the original \(\beta -\)hill climbing, two control parameters are utilized to strike the right balance between a local-nearby exploitation and a global wide-range exploration during the search: \({\mathcal {N}}\) and \(\beta \), respectively. Conventionally, these two parameters require an intensive study to find their suitable values. In order to yield an easy-to-use optimization method, this paper proposes an efficient adaptive strategy for these two parameters in a deterministic way. The proposed adaptive method is evaluated against 23 global optimization functions. The selectivity analysis to determine the optimal progressing values of \({\mathcal {N}}\) and \(\beta \) during the search is carried out. Furthermore, the behavior of the adaptive version is analyzed based on various problems with different complexity levels. For comparative evaluation, the adaptive version is initially compared with the original one as well as with other local search-based methods and other well-regarded methods using the same benchmark functions. Interestingly, the results produced are very competitive with the other methods. In a nutshell, the proposed adaptive \(\beta -\)hill climbing is able to achieve the best results on 10 out of 23 test functions. For more validation, the test functions established in IEEE-CEC2015 are used with various scaling values. The comparative results show the viability of the proposed adaptive method.