An Improved Artificial Bee Colony Algorithm Based on Special Division and Intellective Search


He Huang, Min Zhu, Jin Wang, Journal of Information Processing Systems Vol. 15, No. 2, pp. 433-439, Apr. 2019  

https://doi.org/10.3745/JIPS.02.0111
Keywords: artificial bee colony, Global Search, Intellective Search, Special Division
Fulltext:

Abstract

Artificial bee colony algorithm is a strong global search algorithm which exhibits excellent exploration ability. The conventional ABC algorithm adopts employed bees, onlooker bees and scouts to cooperate with each other. However, its one dimension and greedy search strategy causes slow convergence speed. To enhance its performance, in this paper, we abandon the greedy selection method and propose an artificial bee colony algorithm with special division and intellective search (ABCIS). For the purpose of higher food source research efficiency, different search strategies are adopted with different employed bees and onlooker bees. Experimental results on a series of benchmarks algorithms demonstrate its effectiveness.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
Huang, H., Zhu, M., & Wang, J. (2019). An Improved Artificial Bee Colony Algorithm Based on Special Division and Intellective Search. Journal of Information Processing Systems, 15(2), 433-439. DOI: 10.3745/JIPS.02.0111.

[IEEE Style]
H. Huang, M. Zhu, J. Wang, "An Improved Artificial Bee Colony Algorithm Based on Special Division and Intellective Search," Journal of Information Processing Systems, vol. 15, no. 2, pp. 433-439, 2019. DOI: 10.3745/JIPS.02.0111.

[ACM Style]
He Huang, Min Zhu, and Jin Wang. 2019. An Improved Artificial Bee Colony Algorithm Based on Special Division and Intellective Search. Journal of Information Processing Systems, 15, 2, (2019), 433-439. DOI: 10.3745/JIPS.02.0111.