论文标题
城市包裹物流的动态汇总能力部署
Dynamic Pooled Capacity Deployment for Urban Parcel Logistics
论文作者
论文摘要
最后一英里的物流被认为是包裹物流的重要组成部分。在密集的城市环境中,这部分是由于交通拥堵以及客户位置的差异和可访问性而固有的效率低下引起的。在包裹物流中,访问中心是通过提供临时存储位置来支持基于接力的上一英里活动的设施,从而使最后一英里的活动与其他城市分销链的脱钩。本文重点介绍了一个新的战术问题:在时空不确定性下运行的城市包裹网络中合并可重定位存储容量模块的地理动态部署。特别是,它提出了一个两阶段的随机优化模型,用于访问中心动态汇总能力部署问题,并通过旅行时间估计同步基础操作,以及基于滚动式地平线算法的解决方案方法与lookahead和Benders的分解能够解决实时大小的Meal-Meal-Meal-Onal-Meal-Onal-Meal-Onal-Meal-Onal-Meal-Onal-seal-seal-seal-seal-seal-seal-seal-neal-seal-neactal iNACE。与静态容量部署策略相比,提供了受大包裹快递载体案例的启发,以评估所提出方法的计算性能,并建议节省28%的最后一英里成本和26%的容量能力。
Last-mile logistics is regarded as an essential yet highly expensive component of parcel logistics. In dense urban environments, this is partially caused by inherent inefficiencies due to traffic congestion and the disparity and accessibility of customer locations. In parcel logistics, access hubs are facilities supporting relay-based last-mile activities by offering temporary storage locations enabling the decoupling of last-mile activities from the rest of the urban distribution chain. This paper focuses on a novel tactical problem: the geographically dynamic deployment of pooled relocatable storage capacity modules in an urban parcel network operating under space-time uncertainty. In particular, it proposes a two-stage stochastic optimization model for the access hub dynamic pooled capacity deployment problem with synchronization of underlying operations through travel time estimates, and a solution approach based on a rolling horizon algorithm with lookahead and a benders decomposition able to solve large scale instances of a real-sized megacity. Numerical results, inspired by the case of a large parcel express carrier, are provided to evaluate the computational performance of the proposed approach and suggest up to 28% last-mile cost savings and 26% capacity savings compared to a static capacity deployment strategy.