Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 526315, 9 pages
Research Article

A Simple and Efficient Artificial Bee Colony Algorithm

1School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China
2Department of Information Security Engineering, Chinese People’s Public Security University, Beijing 100038, China
3School of Computer Science, Hubei University of Science and Technology, Xianning 437100, China

Received 7 September 2012; Revised 30 November 2012; Accepted 30 December 2012

Academic Editor: Rui Mu

Copyright © 2013 Yunfeng Xu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Artificial bee colony (ABC) is a new population-based stochastic algorithm which has shown good search abilities on many optimization problems. However, the original ABC shows slow convergence speed during the search process. In order to enhance the performance of ABC, this paper proposes a new artificial bee colony (NABC) algorithm, which modifies the search pattern of both employed and onlooker bees. A solution pool is constructed by storing some best solutions of the current swarm. New candidate solutions are generated by searching the neighborhood of solutions randomly chosen from the solution pool. Experiments are conducted on a set of twelve benchmark functions. Simulation results show that our approach is significantly better or at least comparable to the original ABC and seven other stochastic algorithms.