期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 246, 期 3, 页码 800-814出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2015.05.055
关键词
Combinatorial optimization; Single row facility layout; Local search; Variable neighborhood search
Given n facilities of prescribed lengths and a flow matrix, the single row facility layout problem (SRFLP) is to arrange the facilities along a straight line so as to minimize the total arrangement cost, which is the sum of the products of the flows and center-to-center distances between facilities. We propose interchange and insertion neighborhood exploration-(NE)-procedures with-time-complexity O(n(2)). which is an improvement over O(n(3))-time NE procedures from the literature. Numerical results show that, for large SRFLP instances, our insertion-based local search (LS) algorithm is two orders of magnitude faster than the best existing LS techniques. As a case study, we embed this LS algorithm into the variable neighborhood search (VNS) framework. We report computational results for SRFLP instances of size up to 300 facilities. They indicate that our VNS implementation offers markedly better performance than the variant of VNS that uses a recently proposed O(n(3))-time insertion-based NE procedure. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据