Journal of Global Optimization
On the Analysis of Performance of the Improved Artificial-Bee-Colony Algorithm
ICNC '08 Proceedings of the 2008 Fourth International Conference on Natural Computation - Volume 07
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
Applied Soft Computing
Structural inverse analysis by hybrid simplex artificial bee colony algorithms
Computers and Structures
Chaotic bee colony algorithms for global numerical optimization
Expert Systems with Applications: An International Journal
Artificial bee colony algorithm for small signal model parameter extraction of MESFET
Engineering Applications of Artificial Intelligence
Parallelization of the artificial bee colony (ABC) algorithm
NN'10/EC'10/FS'10 Proceedings of the 11th WSEAS international conference on nural networks and 11th WSEAS international conference on evolutionary computing and 11th WSEAS international conference on Fuzzy systems
Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions
Information Sciences: an International Journal
Artificial bee colony algorithm with multiple onlookers for constrained optimization problems
ECC'11 Proceedings of the 5th European conference on European computing conference
A modified artificial bee colony algorithm
Computers and Operations Research
A modified Artificial Bee Colony algorithm for real-parameter optimization
Information Sciences: an International Journal
Opposition-Based Differential Evolution
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
The working of basic ABC algorithm depends on the functioning of three categories of bees; the employed bees, the onlooker bees and the scout bees. Although, employed and onlooker bees have different functionality, they follow the same equation for exploration and exploitation. Obviously, the performance of ABC greatly depends on single equation. In order to provide a variation in the working of ABC, we propose the use of different equations in the employed bee and onlooker bee phase. The new mechanism proposed by us for the movement of the bees is based on the convex linear combination of three candidate solutions. This scheme is initially embedded in the employed bees phase while the original equation is maintained for the onlooker bees. In the second variation the basic equation for employed bees is retained while for onlooker bees, different equation is used. The simulation results when compared with DE and ABC demonstrate that the modification increases efficiency and capability in terms of balancing exploration and exploitation as well as the accelerating the convergence rate of the ABC.