.png){kind=icon}
返回
A GRASP algorithm for solving large-scale single row facility layout problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2019.02.009.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The single-row facility layout problem (SRFLP) is an NP-hard problem, which consists of arranging facilities along a straight line in order to minimize the weighted sum of distances between all pairs of facilities. In this paper, an implementation of the Greedy Randomized Adaptive Search Procedure (GRASP) meta-heuristic is presented to solve large-scale instances of the problem. The novelty of the proposed implementation is that it is endowed with a diversification phase based on frequency memory. The algorithm was tested on 93 instances with sizes up to one thousand facilities. To date, in the literature, there is only one work, which has considered instances of such magnitude. Computational experiments demonstrate the efficiency of the proposed algorithm, which improved the best-known values for 29 out of 93 instances. (C) 2019 Elsevier Ltd. All rights reserved.
Keyword:
GRASP
Facility layout
Manufacturing optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Reduced white matter microstructural integrity correlates with cognitive deficits in minimal hepatic encephalopathy轻度肝性脑病中白质微结构完整性降低与认知缺陷相关.png)
Gut
GutIF0
PREAI
分享收藏Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods使用穷举2-opt和插入邻域的单行设施布局问题的禁忌搜索
PREAI
分享收藏
分享收藏分享收藏
查看更多内容