4.7 Article

Adaptive binary artificial bee colony algorithm

期刊

APPLIED SOFT COMPUTING
卷 101, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.asoc.2020.107054

关键词

Artificial bee colony; 0-1 programming; Adaptive operator selection; Uncapacitated facility location problems

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

The paper proposes an adaptive hybrid approach to devise ABC algorithms with multiple and complementary binary operators for higher efficiency in solving binary problems. Three prominent operator selection schemes have been comparatively investigated for the best configuration in this regard. The approach has been successfully applied to uncapacitated facility location problems, outperforming state-of-art algorithms in solving well-known benchmarks.
Metaheuristics and swarm intelligence algorithms are bio-inspired algorithms, which have long standing track record of success in problem solving. Due to the nature and the complexity of the problems, problem solving approaches may not achieve the same success level in every type of problems. Artificial bee colony (ABC) algorithm is a swarm intelligence algorithm and has originally been developed to solve numerical optimisation problems. It has a sound track record in numerical problems, but has not yet been tested sufficiently for combinatorial and binary problems. This paper proposes an adaptive hybrid approach to devise ABC algorithms with multiple and complementary binary operators for higher efficiency in solving binary problems. Three prominent operator selection schemes have been comparatively investigated for the best configuration in this regard. The proposed approach has been applied to uncapacitated facility location problems, a renown NP-Hard combinatorial problem type modelled with 0-1 programming, and successfully solved the well-known benchmarks outperforming state-of-art algorithms. (C) 2020 Elsevier B.V. All rights reserved.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据