期刊
INFORMATION PROCESSING LETTERS
卷 111, 期 17, 页码 871-882出版社
ELSEVIER
DOI: 10.1016/j.ipl.2011.06.002
关键词
Randomized algorithms; Artificial bee colony algorithm; Initial population; Solution search equation; Search mechanism
资金
- National Nature Science Foundation of China [60974082]
- Fundamental Research Funds for the Central Universities [JY10000970006]
The artificial bee colony algorithm is a relatively new optimization technique. This paper presents an improved artificial bee colony (IABC) algorithm for global optimization. Inspired by differential evolution (DE) and introducing a parameter M. we propose two improved solution search equations, namely ABC/best/1 and ABC/rand/1. Then, in order to take advantage of them and avoid the shortages of them, we use a selective probability p to control the frequency of introducing ABC/rand/1 and ABC/best/1 and get a new search mechanism. In addition, to enhance the global convergence speed, when producing the initial population, both the chaotic systems and the opposition-based learning method are employed. Experiments are conducted on a suite of unimodal/multimodal benchmark functions. The results demonstrate the good performance of the IABC algorithm in solving complex numerical optimization problems when compared with thirteen recent algorithms. (C) 2011 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据