.png){kind=icon}
返回
Single row facility layout using multi-start simulated annealing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2016.09.026.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the single row facility layout problem (SRFLP), we are given a set of n facilities, their lengths, and a flow cost matrix. The problem asks to arrange the facilities along a straight line so as to minimize the sum of the products of the flow costs and center-to-center distances between facilities. We develop a multi-start simulated annealing (MSA) algorithm for solving this problem. The algorithm employs two move types, pairwise interchanges of facilities and insertions. We propose O(n)-time procedures for computing gains of both types of moves. They make our algorithm very fast compared to the traditional approaches, which are based on a straightforward procedure for obtaining the move gain in O(n(2)) time. When the temperature during the cooling process drops to.a certain level, the computation is accelerated with the use of an additional technique which is reminiscent of a local search algorithm (it takes O(1) time to compute the move gain and O(n(2)) time to perform the required calculations when a move is accepted). We report computational results for SRFLP instances of size up to 1000 facilities. The results demonstrate the superiority of the MSA algorithm over the state-of-the-art methods. The source code implementing MSA is made publicly available as a benchmark for future comparisons. (C) 2016 Published by Elsevier Ltd.
Keyword:
Combinatorial optimization
Heuristics
Facility layout
Simulated annealing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods使用穷举2-opt和插入邻域的单行设施布局问题的禁忌搜索
.png){kind=icon}
PREAI
分享收藏分享收藏
分享收藏An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
PREAI
分享收藏
查看更多内容