论文标题
充血下的逻辑和服务网络中的韦伯问题
The Weber Problem in Logistic and Services Networks under Congestion
论文作者
论文摘要
我们调查了一个位置分配路线问题，卡车将货物从中央生产设施运送到具有固定位置和已知需求的一套仓库。由于能力有限，会发生交通拥堵，并导致排队问题。确定中心的位置是为了最大程度地利用给定资源（在吞吐量中测量），并确定最小的卡车数量以满足仓库产生的整体需求。在战略和战术/运营层面上，此综合决策问题的主要结果是：（i）将位置决策降低到具有加权距离的标准Weber问题。 （ii）对位置和车队规模的联合决定是可分离的。（iii）中心的位置可与操作/战术水平上几个系统参数的扰动稳健。此外，我们将旅行时间最小化为优化目标。
We investigate a location-allocation-routing problem where trucks deliver goods from a central production facility to a set of warehouses with fixed locations and known demands. Due to limited capacities congestion occurs and results in queueing problems. The location of the center is determined to maximize the utilization of the given resources (measured in throughput), and the minimal number of trucks is determined to satisfy the overall demand generated by the warehouses. Main results for this integrated decision problem on strategic and tactical/operational level are: (i) The location decision is reduced to a standard Weber problem with weighted distances. (ii) The joint decision for location and fleet size is separable.(iii) The location of the center is robust against perturbations of several system parameters on the operational/tactical level. Additionally, we consider minimization of travel times as optimization target.
