A Chaotic Based Artificial Bee Colony Algorithm

2018 Fifth HCT Information Technology Trends (ITT)(2018)

引用 1|浏览7
暂无评分
摘要
Since the original artificial bee colony algorithm shows the disadvantages of low optimization accuracy and slow convergence speed, the paper proposes a chaotic based artificial bee colony algorithm (CABC). Based compare the achievements of four chaotic maps based improved ABCs, the improved algorithm based on a Chebyshev chaotic operator is introduced to balance its global and local searches. In addition, considering that the step size of the search has a great influence on the process of optimization, the paper finds the best suitable range of search step value on chaotic operation by experimental results. In the experimental part, we test our algorithm with the traditional artificial bee algorithm and some improved artificial bee colony published in recent years on six representative basic functions. The experimental results verify the great performance of our CABC algorithm.
更多
查看译文
关键词
Artificial bee colony algorithm,Convergence,Optimization,Chebyshev approximation,Information technology,Market research,Telecommunications
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要