Please wait a minute...
Computer & Telecommunication  2015, Vol. 1 Issue (5): 15-18    DOI:
Current Issue | Archive | Adv Search |
Comprehensive Survey on Artificial Bee Colony Algorithm
Yang Suhan,Jiang Hongwei
Beijing Information Science and Technology University
Download:   PDF(0KB)
Export: BibTeX | EndNote (RIS)      
Abstract  Swarm intelligence algorithm develops rapidly these years and solve many large scale complex problems. Artificial bee colony algorithm is a new swarm intelligence algorithm, which gets wide attention for its superior performance, for example, strong global convergence, greedy heuristic search feature and quickly problem solution. The biological background is introduced briefly; modeling thought is given through the comparision between bees foraging behavior and problems solution; and algorithm model is introduced in detail; the research status quo is discussed from improvement and application of the algorithm these years; at last, research prospects are given about artificial bee colony algorithm, and improvement direction and application field are put forward from the weekness analysis of algorithm.
Key wordsswarm intelligence      artificial bee colony algorithm      foraging behavior      algorithm model      research status quo     
Published: 01 January 1900
ZTFLH:  TP301.6  

Cite this article:

Yang Suhan, Jiang Hongwei. Comprehensive Survey on Artificial Bee Colony Algorithm. Computer & Telecommunication, 2015, 1(5): 15-18.

URL:

http://www.computertelecom.com.cn/EN/     OR     http://www.computertelecom.com.cn/EN/Y2015/V1/I5/15

[1] JIN Zhi. Research on Grid Task Scheduling Based on Ant Algorithm[J]. 电脑与电信, 2017, 1(12): 20-22.
[2] Xu Xiangyi. Comparison of Two Intelligent Optimization Algorithms Applied in Traffic Control[J]. 电脑与电信, 2016, 1(9): 67-69.
[3] Song Qian, Wang Dongming. Text Classification Algorithm Based on Genetic Algorithm and Probability Theory[J]. 电脑与电信, 2015, 1(3): 49-52.
Copyright © Computer & Telecommunication, All Rights Reserved.
Powered by Beijing Magtech Co. Ltd