Computer Science ›› 2014, Vol. 41 ›› Issue (2): 102-106.

Previous Articles     Next Articles

Artificial Bee Colony Algorithm Based on Hybrid Rank Mapping Probability and Chaotic Search

ZHANG Xin-ming,WEI Feng,NIU Li-ping and WANG Xian-fang   

  • Online:2018-11-14 Published:2018-11-14

Abstract: In view of the shortcomings of artificial bee colony algorithms,such as the low convergence rate and being trapped into local optimums owing to choosing the food source based on direct mapping probability,an Artificial Bee Colony optimization algorithm based on Hybrid rank mapping probability and Chaotic search (ABC-HC) was proposed in this paper.First,two computing probability method to choose food sources were created based on rank mapping.Then the ABC algorithm based on combining the two probability methods in a onlooker bee phrase was proposed in order to keep diversities of the solutions and not to be trapped into local optimums.Finally,in a scout bee phrase,random search was replaced with chaotic search to get a higher convergence rate and a global solution effectively.The simulation results on 10standard test complicated functions indicate that the proposed optimization algorithm is rapid and effective and outperforms the standard ABC algorithm and the evolutionary ones.

Key words: Artificial bee colony algorithm (ABC),Rank mapping probability,Direct mapping probability,Chaotic search,Random search

[1] Karaboga D.An idea based on honey bee swarm for numerical optimization [R].Technical Report-TR06.Erciyes University,Kayseri,Turkey,2005
[2] Karaboga D,Basturk B.A powerful and efficient algorithm for numerical function optimization:Artificial bee colony (ABC) algorithm [J].Journal of Global Optimization,2007,39(3):459-171
[3] Banharnsakun A,Achalakul T,Sirinaovakul B.The best-so-farselection in artificial bee colony algorithm [J].Applied Soft Computing,2011,11:2888-2901
[4] Li G Q,Niu P F,Xiao X J.Development and investigation of efficient artificial bee colony algorithm for numerical function optimization [J].Applied Soft Computing,2012,12:320-332
[5] Kang F,Li J J,Ma Z Y.Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions [J].Information Sciences,2011,181(1):3508-3531
[6] Gao W F,Liu S Y.A modified artificial bee colony algorithm[J].Computers and Operations Research,2012,39(2):687-697
[7] 毕晓君,王艳娇.加速收敛的人工蜂群算法[J].系统工程与电子技术,2011,33(12):2755-2761
[8] 张新明,孙印杰.基于混沌优化的自适应中值滤波[J].电子技术应用,2007,33(9):63-65
[9] 张新明,徐久成.基于混沌理论和支持向量机的人脸识别方法[J].高技术通讯,2009,19(5):494-500
[10] Zhang X M,Yan L.A fast image thresholding method based on chaos optimization and recursive algorithm for two-dimensional Tsallis entropy [J].Journal of Computers,2010,5(7):1054-1061
[11] Alatas B.Chaotic bee colony algorithms for global numerical optimization [J].Expert Systems with Applications,2010,37:5682-5687
[12] 罗钧,李研.具有混沌搜索策略的蜂群优化算法[J].控制与决策,2010,25(12):1913-1916
[13] 李志勇,李玲玲,王翔,等.基于Memetic 框架的混沌人工蜂群算法[J].计算机应用研究,2012,29(11):4045-4049
[14] 张新明,雷冠军,闫林,等.一种新型快速的直接随机优化算法[J].吉林大学学报:理学版,2012,50(4):750-756
[15] 纪震,廖慧连,吴青华.粒子群算法及应用[M].北京:科学出版社,2009
[16] Yao X,Liu Y,Lin G.Evolutionary programming made faster [J].IEEE Transactions on Evolutionary Computation,1999,3(2):82-102
[17] Dong H B,He J,Huang H K,et al.Evolutionary programming using a mixed mutation strategy [J].Information Sciences,2007,177(1):312-327
[18] Ji M,Yang H,Yang Y,et al.A single component mutation evolutionary programming [J].Applied Mathematics and Computation,2010,215(10):3759-3768

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!