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


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