返回
A quick convergent artificial bee colony algorithm for solving quadratic assignment problems
DOI:10.1016/j.cie.2019.106070.png)
摘要
En 中文
Quadratic assignment problem (QAP) is an NP-hard problem. Because of this computational complexity, various search processes have been developed and used in different heuristics over the years to solve the QAPs. However, in most of those heuristics, the utility of adopting the particular search processes has not been justified. Apart from this, it has been a well-established fact that the convergence rate of any algorithm reduces significantly with the increase in size and flow density of the considered problem. This paper first describes how a quick convergent artificial bee colony (qABC) algorithm is developed using various search processes, and its performance is then evaluated and compared with some of the other state-of-the-art algorithms with respect to convergence, reliability and statistical significance of the results based on the selected problems available in the QAP-library. The comparison results conclude that the qABC algorithm can converge quickly, reliably and statistically more significantly as compared to other algorithms in most of the problem instances.
Keyword:
Combinatorial optimization
QAP
ABC
qABC
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Stability of Reference Genes for Messenger RNA Quantification by Real-Time PCR in Mouse Dextran Sodium Sulfate Experimental Colitis
PLOS ONE
IF0
Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems带有重新调度策略的混合人工蜂群算法求解柔性作业车间调度问题
Hyaluronate and type III procollagen peptide concentrations in bronchoalveolar lavage fluid as markers of disease activity in farmer's lung.
BMJ
IF0

