arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.05016math.OC
收藏

众包配送系统中枢纽选址问题的连续近似方法

A Continuum Approximation Approach to the Hub Location Problem in a Crowd-Shipping System

Patrick Stokkink, Nikolas Geroliminis

AI总结:

本文提出一种基于枢纽的众包配送系统,结合连续近似与大邻域搜索启发式算法高效求解大规模枢纽选址问题,并利用区域预期包裹量设计动态分配策略,在华盛顿特区网络中验证了其速度快且性能优。

摘要:

物流链中的最后一英里配送会导致排放和拥堵加剧。众包配送是传统配送的可持续低成本替代方案,但严重依赖临时配送员的可用性。在本研究中,我们提出了一种基于枢纽的众包配送系统,旨在吸引足够多的潜在众包配送员,以满足小包裹的大部分需求。尽管该问题的小规模版本近期已被解决,但扩展到更大规模实例会使问题显著复杂化。我们设计了一种基于连续近似的启发式方法来评估潜在枢纽选址集合的质量。通过将高效且准确的近似方法与大邻域搜索启发式算法相结合,我们能够高效地找到优质的枢纽选址集合,即使对于大规模网络也是如此。此外,除了确定优质枢纽选址外,我们的方法还能识别每个区域的预期配送包裹数量,这可用于设计智能动态分配策略。基于华盛顿特区网络的案例研究表明,枢纽建在地理位置居中且作为众包配送员热门出发地的位置。最优枢纽数量主要取决于特定枢纽的众包配送员所能服务的边际包裹数量,相对于开放该枢纽所涉及的成本。我们算法的性能接近仿真优化算法,但速度最高快25倍。因此,结果表明基于连续近似估计的动态分配策略优于现有分配策略。

英文摘要:

Last-mile delivery in the logistics chain contributes to emissions and increased congestion. Crowd-shipping is a sustainable and low-cost alternative to traditional delivery, but relies heavily on the availability of occasional couriers. In this work, we propose a hub-based crowd-shipping system that aims to attract sufficient potential crowd-shippers to serve a large portion of the demand for small parcels. While small-scale versions of this problem have been recently addressed, a scaling to larger instances significantly complexifies the problem. A heuristic approach based on continuum approximation is designed to evaluate the quality of a potential set of hub locations. By combining an efficient and accurate approximation method with a large neighborhood search heuristic, we are able to efficiently find a good set of hub locations, even for large scale networks. Furthermore, on top of determining good hub locations, our methods allow to identify the expected number of delivered parcels in every region, which can be used to design a smart dynamic assignment strategy. A case study on the Washington DC network shows that hubs are built at locations that are both geographically central, but most importantly are popular origins for crowd-shippers. The optimal number of hubs is mainly dependent on the marginal number of parcels that can be served by crowd-shippers from a specific hub, relative to the costs involved in opening that hub. The performance of our algorithm is close to that of a simulation-optimization algorithm, yet being up to 25 times faster. Thereby, the results show a dynamic assignment policy based on continuum approximation estimates outperforms existing assignment strategies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑