Hierarchical location-allocation problems: A classification scheme
Hierarchical location-allocation problems: A classification scheme
复制标题
分层位置分配问题：分类方案
DOI：
10.1016/0377-2217(84)90052-3
复制
发表时间：
1984
影响因子：
6.4
通讯作者：
S. Narula
中科院分区：
文献类型：
--
作者：
S. Narula
在文献中，p-中位数问题已经得到了很好的研究。对于p-Medium问题，我们的目标是在n(⩾，p)个地点中选址设施，使总的加权旅行距离最小。在问题描述中，默认假设设施是一种类型，在许多实际情况下，提供产品/服务的系统通常由K(⩾2)种不同类型的设施组成。在这样的问题中，我们想找出设施，i=1，2，…K，在n(⩾Σik=1pi)个可用位置中。在这里，我们的目标也可能是定位这些设施，以使“总加权旅行距离”最小化。使这些问题变得困难和有趣的是，将p-中位数问题的表述和求解程序推广到这些问题并不总是明显、容易或直接的。问题的描述和求解过程依赖于设施类型之间的层次关系以及它们之间允许的商品和服务的流动。
In the literature, thep-median problem has been well studied. For thep-median problem our objective is to locatepfacilities amongn(⩾p) locations such that the total weighted travel distance is minimized. In the problem formulation, it is tacitly assumed that the facilities are of one type.In many practical situations, systems that provide products/services generally consist ofk( ⩾ 2) distinct types of facilities. In such problems, we would like to locatepitypeifacilities,i= 1, 2, …k, amongn( ⩾Σik=1pi) available locations. Here also our objective may be to locate these facilities such that the ‘total weighted travel distance’ is minimized. What makes these problems difficult and interesting is that the extension of thep-median problem formulation and solution procedures to these problems is not always obvious, easy or straightforward. The problem formulation and solution procedures depend upon the hierarchical relationship among the facility types and the flow of goods and services allowed among them.In this paper we attemp to classify the hierarchical location-allocation problems.