Supply facility and input/output point locations in the presence of barriers
Supply facility and input/output point locations in the presence of barriers
复制标题
存在障碍物的供应设施和输入/输出点位置
DOI：
10.1016/s0305-0548(01)00078-8
复制
发表时间：
2002
影响因子：
4.6
通讯作者：
R. Nagi
中科院分区：
文献类型：
--
作者：
Shoou;J. Bhadury;R. Nagi
本文研究了一种以二维欧氏空间表示车间布局的设施选址模型。需求由固定的矩形用户站点产生，并由单个供应设施提供服务。假设（i）供应点与需求设施之间的通信发生在需求设施本身上的输入/输出（I/O）点处，（ii）设施本身构成行进障碍，以及（iii）距离测量是按照L1度量。目标是确定供应设施的最佳位置以及需求设施上的I/O点，以最小化总运输成本。几个，越来越复杂，版本的模型制定和多项式时间算法的开发，以找到在每种情况下的最佳位置。范围和目的在设施布局设置中，通常需要定位新的中央供应设施，例如零件供应中心或工具库，以服务于现有的需求设施（例如，工作站或维护区域）。需求设施点是占用空间的物理实体，无法通过，并且通过外围I/O（输入/输出或卸载/拾取）点从中央设施点接收物料。本文研究了以最小化总的物料运输成本为目标的中心设施选址和各需求设施上的I/O点的联合问题。这个问题的不同版本被认为是。对于一类有约束的选址问题，其求解方法是对选址理论结果的借鉴和推广。对于从业人员，简单的结果和多项式时间算法的开发，解决这些设施（重新）设计问题。
This paper studies a facility location model in which two-dimensional Euclidean space represents the layout of a shop floor. The demand is generated by fixed rectangular-shaped user sites and served by a single supply facility. It is assumed that (i) communication between the supply point and a demand facility occurs at an input/output (I/O) point on the demand facility itself, (ii) the facilities themselves pose barriers to travel and (iii) distance measurement is as per the L1-metric. The objective is to determine optimal locations of the supply facility as well as I/O points on the demand facilities, in order to minimize total transportation costs. Several, increasingly more complex, versions of the model are formulated and polynomial time algorithms are developed to find the optimal locations in each case. Scope and purpose In a facility layout setting, often a new central supply facility such as a parts supply center or tool crib needs to be located to serve the existing demand facilities (e.g., workstations or maintenance areas). The demand facilities are physical entities that occupy space, that cannot be traveled through, and that receive material from the central facility, through a perimeter I/O (input/output or drop-off/pick-up) point. This paper addresses the joint problem of locating the central facility and determining the I/O point on each demand facility to minimize the total material transportation cost. Different versions of this problem are considered. The solution methods draw from and extend results of location theory for a class of restricted location problems. For practitioners, simple results and polynomial time algorithms are developed for solving these facility (re) design problems.