A hybrid artificial bee colony algorithm based on different search mechanisms

被引：0

作者：

School of Information Engineering, Nanchang Institute of Technology, Nanchang ^{[1
]}

330099, China

不详 ^{[2
]}

330099, China

机构：

[1] School of Information Engineering, Nanchang Institute of Technology, Nanchang

[2] Jiangxi Province Key Laboratory of Water Information Cooperative Sensing and Intelligent Processing, Nanchang

来源：

Int. J. Wireless Mobile Comput. | / 4卷 / 383-390期

基金：

中国国家自然科学基金;

关键词：

Artificial bee colony algorithm; Convergence speed; Exploration; Global optimisation; Search mechanisms;

D O I：

10.1504/IJWMC.2015.074033

中图分类号：

学科分类号：

摘要：

In order to overcome the drawbacks of standard artificial bee colony (ABC) algorithm, such as slow convergence and low solution accuracy, a hybrid ABC algorithm based on different search mechanisms is proposed in this paper. According to the type of position information in ABC, three basic search mechanisms are summarised which include searching around the individual, the random neighbour, and the global best solution. Then, the basic search mechanisms are improved to obtain three search strategies. All of these strategies can make a good balance between exploration and exploitation. At every iteration, each bee randomly selects a search strategy to produce a candidate solution under the same probability. The experiment is conducted on 12 classical functions and 28 CEC2013 functions. Results show that the new algorithm performs significantly better than several recently proposed similar algorithms in terms of the convergence speed and solution accuracy. © Copyright 2015 Inderscience Enterprises Ltd.

引用

页码：383 / 390

页数：7

共 19 条

[1]

Banharnsakun A., Achalakul T., Sirinaovakul B., The best-so-far selection in artificial bee colony algorithm, Applied Soft Computing, 11, 2, pp. 2888-2901, (2011)

[2]

Coelho L.D.S., Ayala H.V.H., Freire R.Z., Population's variance-based adaptive differential evolution for real parameter optimization, Proceedings of IEEE Congress on Evolutionary Computation, pp. 1672-1677, (2013)

[3]

Davis L., Adaptive operator probabilities in genetic algorithms, Proceeding of 3rd International Conference on Genetic Algorithms, pp. 61-69, (1989)

[4]

Elsayed S.M.M., Sarker R.A., Ray T., Differential evolution with automatic parameter configuration for solving the CEC2013 competition on real-parameter optimization, Proceedings of IEEE Congress on Evolutionary Computation, pp. 1932-1937, (2013)

[5]

Friedman M., The use of ranks to avoid the assumption of normality implicit in the analysis of variance, Journal of the American Statistical Association, 32, 200, pp. 675-701, (1937)

[6]

Gao W., Liu S., A modified artificial bee colony algorithm, Computers & Operations Research, 39, 3, pp. 687-697, (2012)

[7]

Horng S.C., Combining artificial bee colony with ordinal optimization for stochastic economic lot scheduling problem, IEEE Transactions on Systems, Man, and Cybernetics: Systems, 45, 3, pp. 373-384, (2015)

[8]

Karaboga D., An Idea Based on Honey Bee Swarm for Numerical Optimization, Technical Report, (2005)

[9]

Karaboga D., Akay B., A comparative study of artificial bee colony algorithm, Applied Mathematics and Computation, 214, 1, pp. 108-132, (2009)

[10]

Kennedy J., Eberhart R.C., Particle swarm optimization, Proceedings of the IEEE International Conference on Neural Networks, 4, pp. 1942-1948, (1995)

← 1 2 →