拥挤条件下物流服务网络的Weber问题
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。