BSA: A Hybrid Bees’ Simulated Annealing Algorithm To Solve Optimization & NP-Complete Problems

Abstract

Swarm-based algorithms such as Bees Algorithm BA have proven to be very powerful computational techniques due to their search capabilities. Other methods which are useful in diverse application areas are simulated annealing, evolution strategies etc. The searching ability of these algorithms can be improved by properly blending their characteristic features. In this paper an attempt is made to intermix the search properties of BA and SA, in order to develop a hybrid algorithm which is equally applicable and has a better searching ability and power to reach a near optimal solution. This leads to the development of a fast method to solve complicated types of optimization and NP-complete problems.