Document Type: Original Research Paper

Authors

1 payame noor university,tehran,iran.

2 payame noor university,tehran.iran

Abstract

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.

Keywords

Main Subjects

[1] D. Karaboga., and B. Basturk., "A powerful and Efficient Algorithm for Numerical Function Optimization: Artificial Bee Colony (ABC) Algorithm" Journal of Global optimization vol. 39, pp. 459-471, November 2007.
[2] J.J. Liang., A.K. Qin, “Comprehensive Learning Particle Swarm Optimizer for Global Optimization of Multimodal Functions”, Proceedings of IEEE Transaction of Evolutionary Computation, vol. 10, No. 3, June 2006.
[3]Liang J, Lee C,” A Modification Artificial Bee Colony Algorithm for Optimization Problems”, Mathematical Problems in Engineering Volume 2015 (2015).
[4] B. Akay and D. Karaboga, “A modified Artificial Bee Colony algorithm for real-parameter optimization,” Information Sciences, vol. 192, pp. 120–142, 2012.
[5] HAI-BIN DUAN, CHUN-FANG XU, and ZHI-HUI XING,” A hybrid artificial bee colony optimization and quantum evolutionary algorithm for continuous optimization problems”2010.
[6] Hadidi, Kazemzade.," Structural optimization using artificial bee colony algorithm” 2nd International Conference on Engineering Optimization September 6 - 9, (2010), Lisbon, Portugal.
[7] W. Gao , S. Liu “ A modified artificial bee colony algorithm”.Computer & Operation Research. 39 , 3 , 687-697 ,2012.
[8] D. Karaboga, “An idea based on honey bee swarm fornumerical optimization”. Technical Report-TRO6. Kayseri, Turkey: Erciyes.
[9] Jing, Hong,” Improved Artificial Bee Colony Algorithm and Application in Path Planning of Crowd Animation” International Journal of Control and Automation Vol.8, No.3 (2015), pp.53-66.
[10] T. Chen, XU,” Solving a timetabling problem with an artificial bee colony algorithm” World Transactions on Engineering and Technology Education Vol.13, No.3, 2015.
[11] R. Poli, J. Kennedy, T. Blackwell, Particle swarm optimization: An overview (Springer Science and Business Media, LLC (2007).
[12] Pei-Wei TSai, Jeng-Shyang Pan, Bin-Yih Liao, Shu-Chuan Chu, Enhanced Artificial Bee Colony Optimization , International Journal of Innovative Computing, Information and Control, Volume 5, Number 12, December (2009).
[13] Yang, X. S. , Nature-Inspired Metaheuristic Algorithms, Luniver Press(2008).
[14] R. Khaze, I. maleki, S. Hojjatkhah and A.Bagherinia, EVALUATION THE EFFICIENCY OF ARTIFICIAL BEE COLONY AND THE FIREFLY ALGORITHM IN SOLVING THE CONTINUOUS OPTIMIZATION PROBLEM, International Journal on Computational Sciences & Applications (IJCSA) Vol.3, No.4, August 2013.
[15] X-S. Yang," Firefly Algorithm, L´evy Flights and Global Optimization" arXiv:1003.1464v1 [math.OC] 7 Mar (2010).
[16] A Hashmi, Nishant Goel, Shruti Goel, Divya Gupta,” Firefly Algorithm for Unconstrained Optimization” IOSR Journal of Computer Engineering (IOSR-JCE) e-ISSN: 2278-0661, p- ISSN: 2278-8727Volume 11, Issue 1,(2013).