.png){kind=icon}
返回
A novel hybrid immune clonal selection algorithm for the constrained corridor allocation problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10845-020-01693-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Aiming at the lack of relevant research on relationship constraints between facilities in the corridor allocation problem (CAP). In this paper, fixed position constraints and ordering constraints are considered in CAP, and the logistics cost is minimized. Considering that the existing search technology is complicated and time-consuming in dealing with such constrained CAP (cCAP), and immune clone selection algorithm with variable neighborhood operation (ICSAVNS) is provided for solving this problem. Two approaches to initial solution generation are designed to improve the quality of the initial population. A variable neighborhood search operator is embedded to improve the accuracy of the local search. A threshold is set in the mutation operation of the ICSAVNS to achieve population expansion better. A double index of sequences consisting of affinity values and constrained facility index values is used to select and reselect, achieving population compression in the clonal selection part. Finally, by exactly solving the model, the rationality of the model is verified. The hybrid clone selection algorithm is used to solve the cCAP and cbCAP benchmark instances of different sizes, and compared with the state-of-the-art optimization algorithms. The results show that the proposed algorithm exhibits better performance.
Keyword:
Facility layout
Constrained corridor allocation problem
Immune clonal selection algorithm
Variable neighbourhood search operation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.4
论文数:
3.5K
被引数:
1.1W
机构
引用论文
Red deer algorithm (RDA): a new nature-inspired meta-heuristic马鹿算法 (RDA): 一种新的自然启发的元启发式算法.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏A methodology for solving facility layout problem considering barriers: genetic algorithm coupled with A* search考虑障碍的设施布局问题求解方法: 遗传算法与A * 搜索相结合
OAAI
OAAI分享收藏分享收藏Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods使用穷举2-opt和插入邻域的单行设施布局问题的禁忌搜索
PREAI
分享收藏
分享收藏
查看更多内容