期刊
IEEE TRANSACTIONS ON CYBERNETICS
卷 45, 期 12, 页码 2827-2839出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2014.2387067
关键词
Artificial bee colony algorithm; clustering partition; search equation; search mechanism
类别
资金
- National Nature Science Foundation of China [61402534, 61373174, 61201455, 61301243]
- Shandong Provincial Natural Science Foundation of China [ZR2014FQ002]
- Fundamental Research Funds for the Central Universities [14CX02160A]
Inspired by the fact that the division of labor and cooperation play extremely important roles in the human history development, this paper develops a novel artificial bee colony algorithm based on information learning (ILABC, for short). In ILABC, at each generation, the whole population is divided into several subpopulations by the clustering partition and the size of subpopulation is dynamically adjusted based on the last search experience, which results in a clear division of labor. Furthermore, the two search mechanisms are designed to facilitate the exchange of information in each subpopulation and between different subpopulations, respectively, which acts as the cooperation. Finally, the comparison results on a number of benchmark functions demonstrate that the proposed method performs competitively and effectively when compared to the selected state-of-the-art algorithms.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据