Self-adaptive artificial bee colony. (English) Zbl 1305.90411

Summary: Artificial Bee Colony (ABC) optimization algorithm is a swarm intelligence-based nature inspired algorithm, which has been proved a competitive algorithm with some popular nature-inspired algorithms. ABC has been found to be more efficient in exploration as compared to exploitation. With a motivation to balance exploration and exploitation capabilities of ABC, this paper presents an adaptive version of ABC. In this adaptive version, step size in solution modification and ABC parameter ‘limit’ are set adaptively based on current fitness values. In the present self-adaptive ABC, good solutions are appointed to exploit the search region in their neighbourhood, while worse solutions are appointed to explore the search region. The better solutions are given higher chances to update themselves with the help of parameter ‘limit’, which changes adaptively in the present study. The experiments on 16 unbiased test problems of different complexities show that the proposed strategy outperforms the basic ABC and some recent variants of ABC.


90C59 Approximation methods and heuristics in mathematical programming
65K05 Numerical mathematical programming methods
68T05 Learning and adaptive systems in artificial intelligence
Full Text: DOI


[1] Price KV, Differential evolution: a practical approach to global optimization (2005)
[2] DOI: 10.1007/s00500-012-0957-7 · Zbl 06173797
[3] DOI: 10.1109/MCS.2002.1004010
[4] Karaboga D. An idea based on honey bee swarm for numerical optimization. Tech. Rep. TR06. Erciyes: Erciyes University Press; 2005.
[5] DOI: 10.1016/j.amc.2009.03.090 · Zbl 1169.65053
[6] DOI: 10.1016/j.amc.2010.08.049 · Zbl 1204.65074
[7] DOI: 10.1016/j.asoc.2010.11.025 · Zbl 05889601
[8] DOI: 10.1016/j.ins.2010.07.015 · Zbl 06094419
[9] Gao W, Comput. Oper. Res 9 pp 687– (2011)
[10] Tsai PW, Int. J. Innovative Comput. Inf. Control 5 (2009)
[11] DOI: 10.5772/5101
[12] DOI: 10.1016/j.asoc.2010.12.001 · Zbl 05889622
[13] DOI: 10.1016/S0045-7825(99)00389-8 · Zbl 1028.90533
[14] DOI: 10.1016/j.ins.2011.04.024 · Zbl 1242.65124
[15] Goldberg DE, Genetic algorithms in search, optimization, and machine learning (1989) · Zbl 0721.68056
[16] DOI: 10.1023/A:1008202821328 · Zbl 0888.90135
[17] DOI: 10.1007/978-3-642-20161-5_25 · Zbl 05924367
[18] DOI: 10.1007/s10898-004-9972-2 · Zbl 1093.90028
[19] Suganthan PN, In: CEC 2005 (2005)
[20] DOI: 10.1007/s12293-011-0065-8
[21] DOI: 10.1016/j.ins.2011.09.005 · Zbl 06098916
[22] DOI: 10.1109/TEVC.2007.894200 · Zbl 05516149
[23] DOI: 10.7326/0003-4819-110-11-916
[24] DOI: 10.1016/j.amc.2006.10.047 · Zbl 1137.90726
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.