.png){kind=icon}
返回
An efficient iterated local search algorithm for the corridor allocation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2022.118804.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The corridor allocation problem (CAP) seeks the optimal arrangement of departments along the two sides of a corridor with respect to two key considerations; there should be no gap between two consecutive departments, and both of the rows should start at the same level of the corridor. In this study, a new and comprehensive multi -start iterated local search (ILS) algorithm is developed for CAP to search the solution space more effectively. The proposed algorithm utilizes a variable neighborhood descent (VND) for local search. The VND algorithm employs five neighborhood search mechanisms (swap, insert, inverse, cross, and block insert) and a tabu list to avoid cycling. The performance of the proposed ILS is evaluated on well-known instances of various sizes. Objective function values of 34 out of 82 benchmark instances are improved by the proposed algorithm. The computational results also show that the algorithm is capable of dealing with larger-sized problems with up to eighty departments.
Keyword:
Facility layout
Corridor allocation problem
Iterated local search
Variable neighborhood descent
Combinatorial optimization
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
A problem evolution algorithm with linear programming for the dynamic facility layout problem-A general layout formulation动态设施布局问题的线性规划问题演化算法-一般布局公式
.png){kind=icon}
PREAI
分享收藏A closed loop based facility layout design using a cuckoo search algorithm使用布谷鸟搜索算法的基于闭环的设施布局设计
PREAI
分享收藏Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods使用穷举2-opt和插入邻域的单行设施布局问题的禁忌搜索
PREAI
分享收藏
分享收藏
查看更多内容