.png){kind=icon}
返回
A matheuristic for solving the single row facility layout problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2026.107397.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The single row facility layout problem (SRFLP) is a well-studied NP-hard combinatorial optimization problem with applications in manufacturing and logistics systems. In the SRFLP, a set of facilities with lengths is given, as well as weights between each pair of facilities. The facilities must be arranged on a line, such that the sum of the weighted center-to-center distances is minimized. In this work, we introduce a novel matheuristic approach that integrates exact optimization into a metaheuristic framework based on simulated annealing to effectively solve large-scale SRFLP instances. Specifically, we propose the window approach matheuristic, which allows to solve subsegments of the layout to optimality using mixed-integer programming while preserving the ordering of facilities outside the window. To the best of our knowledge, this constitutes the first matheuristic approach specifically designed for the SRFLP. We evaluate the performance of our method on the widely-used benchmark instance sets from literature. The computational results demonstrate that our matheuristic improves the best-known solution values for 13 of 70 instances, and matches the best-known solution values for the remaining 57 instances, outperforming current state-of-the-art metaheuristics.
Keyword:
Matheuristic
Integer programming
Multi-start simulated annealing
Facility layout
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
265
被引数:
0
机构
引用论文
.png){kind=icon}
分享收藏Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods使用穷举2-opt和插入邻域的单行设施布局问题的禁忌搜索
PREAI
分享收藏分享收藏分享收藏分享收藏
查看更多内容