An enhancement to the Bees Algorithm with slope angle computation and Hill Climbing Algorithm and its applications on scheduling and continuous-type optimisation problem

Abstract

This paper focuses on improvements to the Bees Algorithm (BA) with slope angle computation and Hill Climbing Algorithm (SACHCA) during the local search process. First, the SAC was employed to determine the inclination of the current sites. Second, according to the slope angle, the HCA was utilised to guide the algorithm to converge to the local optima. This enabled the global optimum of the given problem to be found faster and more precisely by focusing on finding the available local optima first before turning the attention on the global optimum. The proposed enhancements to the BA have been tested on continuous-type benchmark functions and compared with other optimisation techniques. The results show that the proposed algorithm performed better than other algorithms on most of the benchmark functions. The enhanced BA performs better than the basic BA, in particular on higher dimensional and complex optimisation problems. Finally, the proposed algorithm has been used to solve the single machine scheduling problem and the results show that the proposed SAC and HCA-BA outperformed the basic BA in almost all the considered instances, in particular when the complexity of the problem increases.