A hybrid meta-heuristic algorithm based on ABC and Firefly algorithms

Abstract— In this paper we have tried to develop an altered version of the artificial bee colony algorithm which is inspired from and combined with the meta-heuristic algorithm of firefly. In this method, we have tried to change the main equation of searching within the original ABC algorithm. On this basis, a new combined equation was used for steps of employed bees and onlooker bees. For this purpose, we had to define several new parameters for improving the quality of the proposed method. In this regard, we have introduced two new parameters to the method. The new method has been simulated within the software of MATLAB and it has also been run according to objective functions of SPHERE, GRIEWANK and ACKLEY. All these functions are standard evaluation functions that are generally used for meta-heuristic algorithms. Results that were yielded by the proposed method were better than the results of the initial algorithm and especially by increasing the number of variables of the problem, this improvement becomes even more significant. We have successfully established a better balance between concepts of exploration and exploitation, especially with increasing the repetition cycles, we have successfully controlled the concept of utilization with random parameters. Tests have been ran more than 500 times.

A hybrid meta-heuristic algorithm based on ABC and Firefly algorithms Keywords:

ABC algorithm , Firefly algorithm , Onlooker bee , Employed bee , Exploration