Modified Gbest-guided artificial bee colony algorithm with new probability model
- 393 Downloads
Artificial bee colony (ABC) is a very effective and efficient swarm-based intelligence optimization algorithm, which simulates the collective foraging behavior of the honey bees. However, ABC has strong exploration ability but poor exploitation ability because its solution search equation performs well in exploration but badly in exploitation. In order to enhance the exploitation ability and obtain a better balance between exploitation and exploration, in this paper, a novel search strategy which exploits the valuable information of the current best solution and a novel probability model which makes full use of the other good solutions on onlooker bee phase are proposed. To be specific, in the novel search strategy, a parameter P is used to control which search equation to be used, the original search equation of ABC or the new proposed search equation. The new proposed search equation utilizes the useful information from the current best solution. In the novel probability model, the selected probability of the good solution is absolutely significantly larger than that of the bad solution, which makes sure the good solutions can attract more onlooker bees to search. We put forward a new ABC variant, named MPGABC by combining the novel search strategy and probability model with the basic framework of ABC. Through the comparison of MPGABC and some other state-of-the-art ABC variants on 22 benchmark functions, 22 CEC2011 real-world optimization problems and 28 CEC2013 real-parameter optimization problems, the experimental results show that MPGABC is better than or at least comparable to the competitors on most of benchmark functions and real-world problems.
KeywordsArtificial bee colony algorithm Search strategy Probability model Global optimization
This work is supported by the National Natural Science Foundation of China under Grants 61402294, 61472258 and 61572328, Guangdong Natural Science Foundation under Grant S2013040012895, Foundation for Distinguished Young Talents in Higher Education of Guangdong, China, under Grant 2013LYM_0076, Major Fundamental Research Project in the Science and Technology Plan of Shenzhen under Grants KQCX20140519103756206, JCYJ20140418091413526, JCYJ20140509172609162, JCYJ20140828163633977, JCYJ20140418181958501, JCYJ20150630105452814, JCYJ20160310095523765 and JCYJ20160307111232895. The Open Research Fund of China-UK Visual Information Processing Lab.
Compliance with ethical standards
Conflict of interest
All authors declare that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
- Bayraktar T (2014) A memory-integrated artificial bee algorithm for heuristic optimization, M. SC. thesis. University of BedfordshireGoogle Scholar
- Das S, Suganthan PN (2010) Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems. Jadavpur University, India and Nanyang Technological University, Singapore; 2010 Technical reportGoogle Scholar
- Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst 26(1):29–41Google Scholar
- Fister I, Fjjr I, Brest J, Zumer V (2012) Memetic artificial bee colony algorithm for large-scale global optimization. IEEE Congress on Evolutionary Computation 2012 (pp 1–8). IEEEGoogle Scholar
- Kang F, Li JJ, Xu Q (2009) Structural inverse analysis by hybrid simplex artificial bee colony algorithms. Comput Struct 87(13–14):816–870Google Scholar
- Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical report-TR06, Erciyes UniversityGoogle Scholar
- Kennedy J, Eberhart R (1995) Particle swarm optimization. IEEE Int Conf Neural Netw 4:1942–1948Google Scholar
- Liang JJ, Qu BY, Suganthan PN, Alfredo GH (2013) Problem definitions and evaluation criteria for the CEC 2013 special session on real-parameter optimization. Technical report 201212, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and technical report, Nanyang Technological University, Singapore, January 2013Google Scholar
- Lin QZ, Chen JY, Zhan ZH, Chen WN, Coello CAC, Yin YL, Lin CM, Zhang J (2015) A hybrid evolutionary immune algorithm for multiobjective optimization problems. IEEE Trans Evolut Comput 20(5):711–729Google Scholar
- Marinakis Y, Marinaki M, Matsatsinis N (2009) A hybrid discrete artificial bee colony—GRASP algorithm for clustering. In: Proceedings of the international conference on computers & industrial engineering 2009. IEEE, pp 548–553Google Scholar
- Reza A, Hedayatzadeh R, Ziarati K, Hassanizadeh B (2012) A multi-objective artificial bee colony algorithm. Swarm Evol Comput 2(1):39–52Google Scholar
- Shalan SAB, Ykhlef M (2015) Multi-objective portfolio optimization problem for Saudi Arabia stock market using hybrid clonal selection and particle swarm optimization. J Sci Eng 40(8):2407–2421Google Scholar
- Shi X, Li Y, Li H, Guan R, Wang L, Liang Y (2010) An integrated algorithm based on artificial bee colony and particle swarm optimization. IEEE Int Conf Neural Netw 5:2586–2590Google Scholar
- Xiang WL, An MQ (2013) An efficient and robust artificial bee colony algorithm for numerical optimization. Comput Oper Res 40(5):1256–1265Google Scholar
- Xiao R, Chen T (2011) Enhancing ABC optimization with Ai-net algorithm for solving project scheduling problem. ICNC 3:1284–1288Google Scholar
- Zhou XY, Wang H, Wang MW, Wan JY (2015) Enhancing the modified artificial bee colony algorithm with neighborhood search. Soft Comput. doi: 10.1007/s00500-015-1977-x