Comparative Study of Artificial Bee Colony Algorithm and Real Coded Genetic Algorithm for Analysing Their Performances and Development of a New Algorithmic Framework

This paper compares performance of the artificial bee colony algorithm (ABC) and the real coded genetic algorithm (RCGA) on a suite of 9 standard benchmark problems. The problem suite comprises a diverse set of unimodal, multimodal and rotated multimodal numerical optimization functions and the comparison criteria include (i) solution quality, (ii) convergence speed, (iii) robustness, and (iv) scalability to test efficacy of the algorithms. To the best knowledge of the authors, such a comprehensive comparative study of the two algorithms is not available in the literature. An empirical study shows that the RCGA has advantages over the ABC in terms of all the criteria for the unimodal and the rotated multimodal functions. On other hand, the ABC outperforms the RCGA in terms of solution quality for the multimodal functions. Therefore, based on the insights gained out of this comparative study, the authors propose an algorithm ABC-GA with new algorithmic framework that comprises advantages of both the ABC and the GA. An empirical study of the proposed algorithm ABC-GA shows its promising performance as the obtained results are superior to both the comparative algorithms for all the problems in all the criteria.

[1]  David E. Goldberg,et al.  Genetic algorithms and Machine Learning , 1988, Machine Learning.

[2]  Xia Li,et al.  A Comparative Study of Artificial Bee Colony, Bees Algorithms and Differential Evolution on Numerical Benchmark Problems , 2010, ISICA.

[3]  Alden H. Wright,et al.  Genetic Algorithms for Real Parameter Optimization , 1990, FOGA.

[4]  D. Karaboga,et al.  On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..

[5]  Bijaya K. Panigrahi,et al.  Comparative study of five bio-inspired evolutionary optimization techniques , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[6]  Janez Brest,et al.  A Brief Review of Nature-Inspired Algorithms for Optimization , 2013, ArXiv.

[7]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[8]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[9]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[10]  Rosni Abdullah,et al.  A hybrid artificial bee colony algorithm for numerical function optimization , 2015 .

[11]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[12]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..

[13]  R. Salomon Re-evaluating genetic algorithm performance under coordinate rotation of benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms. , 1996, Bio Systems.

[14]  Dervis Karaboga,et al.  Parameter Tuning for the Artificial Bee Colony Algorithm , 2009, ICCCI.

[15]  Xiaohui Yan,et al.  A new approach for data clustering using hybrid artificial bee colony algorithm , 2012, Neurocomputing.