期刊
OPSEARCH
卷 49, 期 4, 页码 442-462出版社
SPRINGER INDIA
DOI: 10.1007/s12597-012-0091-4
关键词
Single row facility layout problem; Literature review; Formulation; Exact algorithms; Heuristics; Benchmark instances
The single row facility layout problem (SRFLP) is a NP-hard problem concerned with the arrangement of facilities of given lengths on a line so as to minimize the weighted sum of the distances between all the pairs of facilities. The SRFLP and its special cases often arise while modeling a large variety of applications. It has been actively researched until the mid-nineties, and then again since 2005. Interestingly, research on many aspects of this problem is still in the initial stages, and hence the SRFLP is an interesting problem to work on. In this paper, we review the literature on the SRFLP and comment on its relationship with other layout problems. We then provide an overview of different formulations of the problem that appear in the literature. We provide exact and heuristic approaches that have been used to solve SRFLPs, and also present details about the benchmark instances widely used in the literature. We finally point out research gaps and promising directions for future research on this problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据