Fully informed artificial bee colony algorithm

The Gbest-guided artificial bee colony (GABC) algorithm is a latest swarm intelligence-based approach to solve optimisation problem. In GABC, the individuals update their respective positions by drawing inspiration from the global best solution available in the current swarm. The GABC is a popular variant of the artificial bee colony (ABC) algorithm and is proved to be an efficient algorithm in terms of convergence speed. But, in this strategy, each individual is simply influenced by the global best solution, which may lead to trap in local optima. Therefore, in this paper, a new search strategy, namely “Fully Informed Learning” is incorporated in the onlooker bee phase of the ABC algorithm. The developed algorithm is named as fully informed artificial bee colony (FABC) algorithm. To validate the performance of FABC, it is tested on 20 well-known benchmark optimisation problems of different complexities. The results are compared with those of GABC and some more recent variants of ABC. The results are very promising and show that the proposed algorithm is a competitive algorithm in the field of swarm intelligence-based algorithms.

[1]  René Thomsen,et al.  A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[2]  Harish Sharma,et al.  Power law-based local search in artificial bee colony , 2014, Int. J. Artif. Intell. Soft Comput..

[3]  Martin Middendorf,et al.  Performance evaluation of artificial bee colony optimization and new selection schemes , 2011, Memetic Comput..

[4]  Harish Sharma,et al.  Self-adaptive artificial bee colony , 2014 .

[5]  Kusum Deep,et al.  A new crossover operator for real coded genetic algorithms , 2007, Appl. Math. Comput..

[6]  Natalio Krasnogor,et al.  Editorial to the first issue , 2009, Memetic Comput..

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

[8]  Harish Sharma,et al.  Balanced artificial bee colony algorithm , 2013, Int. J. Artif. Intell. Soft Comput..

[9]  Harish Sharma,et al.  Memetic search in artificial bee colony algorithm , 2013, Soft Computing.

[10]  Dervis Karaboga,et al.  A modified Artificial Bee Colony (ABC) algorithm for constrained optimization problems , 2011, Appl. Soft Comput..

[11]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[12]  Dervis Karaboga,et al.  A comparative study of Artificial Bee Colony algorithm , 2009, Appl. Math. Comput..

[13]  D. Williamson,et al.  The box plot: a simple visual method to interpret data. , 1989, Annals of internal medicine.

[14]  Harish Sharma,et al.  Dynamic Scaling Factor Based Differential Evolution Algorithm , 2011, SocProS.

[15]  Mohammed El-Abd,et al.  Performance assessment of foraging algorithms vs. evolutionary algorithms , 2012, Inf. Sci..

[16]  Sam Kwong,et al.  Gbest-guided artificial bee colony algorithm for numerical function optimization , 2010, Appl. Math. Comput..

[17]  K. V. Arya,et al.  Opposition based lévy flight artificial bee colony , 2012, Memetic Computing.

[18]  Weifeng Gao,et al.  A modified artificial bee colony algorithm , 2012, Comput. Oper. Res..

[19]  Harish Sharma,et al.  Cognitive learning in differential evolution and its application to model order reduction problem for single-input single-output systems , 2012, Memetic Comput..

[20]  R. Storn,et al.  Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series) , 2005 .

[21]  Dervis Karaboga,et al.  A modified Artificial Bee Colony algorithm for real-parameter optimization , 2012, Inf. Sci..

[22]  M.M.A. Salama,et al.  Opposition-Based Differential Evolution , 2008, IEEE Transactions on Evolutionary Computation.

[23]  Tiranee Achalakul,et al.  The best-so-far selection in Artificial Bee Colony algorithm , 2011, Appl. Soft Comput..

[24]  H. B. Mann,et al.  On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other , 1947 .

[25]  José Neves,et al.  The fully informed particle swarm: simpler, maybe better , 2004, IEEE Transactions on Evolutionary Computation.

[26]  G. Di Caro,et al.  Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).