.png){kind=icon}
返回
Chaos driven discrete artificial bee algorithm for location and assignment optimisation problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2015.03.002.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The chaos driven discrete artificial bee colony (CDABC) algorithm is introduced in this paper. Four unique chaos maps of Burgers, Lozi, Delayed Logistic and Tinkerbell are embedded as chaos pseudo-random number generators and compared with the Mersenne Twister pseudo-random number generator. Two unique problems of quadratic assignment and capacitated vehicle routing problem are solved using five different variants of the algorithm and analytical comparison is conducted. Furthermore, paired t-test is done pairwise on all variants, and from these results it is ascertained that the Tinkerbell variant of CDABC is the best performing for both problem classes. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Artificial bee colony
Chaos maps
Quadratic assignment problem
Capacitated vehicle routing problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
Utilising the chaos-induced discrete self organising migrating algorithm to solve the lot-streaming flowshop scheduling problem with setup time.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏
查看更多内容