4.6 Article

Shuffled artificial bee colony algorithm

期刊

SOFT COMPUTING
卷 21, 期 20, 页码 6085-6104

出版社

SPRINGER
DOI: 10.1007/s00500-016-2166-2

关键词

Computational intelligence; Optimization; Artificial bee colony; Shuffled frog-leaping algorithm; Chemical engineering problems

向作者/读者索取更多资源

In this study, we have introduced a hybrid version of artificial bee colony (ABC) and shuffled frog-leaping algorithm (SFLA). The hybrid version is a two-phase modification process. In the first phase to increase the global convergence, the initial population is produced using randomly generated and chaotic system, and then in the second phase to balance two antagonist factors, i.e., exploration and exploitation capabilities, population is portioned into two groups (superior and inferior) based on their fitness values. ABC is applied to the first group, whereas SFLA is applied to the second group of population. The proposed version is named as Shuffled-ABC. The proposal is implemented and tested on constrained benchmark consulted from CEC 2006 and five chemical engineering problems where constraints are handled using penalty function methods. The simulated results illustrate the efficacy of the proposal.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据