首页> 外文期刊>Transportation Research Procedia >Same-Day Delivery with Crowdshipping and Store Fulfillment in Daily Operations
【24h】

Same-Day Delivery with Crowdshipping and Store Fulfillment in Daily Operations

机译:日常运营中的当天拥挤和商店配送

获取原文
           

摘要

This paper examines the problem of daily operations of same-day delivery with crowdshipping and store fulfillment (SDD-CSF). We aim to close the last-mile delivery gap between local stores and customers. SDD-CSF makes order fulfillment plan from two aspects: order souring decision and delivery method selection in order to minimize the cost associated with the order fulfillment plan. We adopt the new concept of last-mile delivery from local stores using crowdsourced shipping, which includes two specific delivery methods based on the distinct characteristics of crowdsourced shippers: Information Sharing Driver (ISDs) and Occasional Drivers (ODs). We devise a dynamic programming model for order fulfillment in a rolling horizon framework, which later is mathematically approximated into a mixed integer linear programming model. The model considers both currently received orders and the predicted future demand to make order assignment decision that minimizes the immediate delivery cost plus the resulting future expected cost. It repeatedly solves the model following the timeline in order to construct an optimal fulfillment plan from local stores. With the help of the rolling horizon structure, we also introduce a feedback control system to cope with the inaccurate forecast of future demand. Finally, we prove that under perfect information, the proposed formulation can converge to the global optimum.
机译:本文研究了具有众筹和商店履行(SDD-CSF)的当天交付的日常运营问题。我们的目标是缩小本地商店与客户之间的最后一英里交付差距。 SDD-CSF从两个方面制定订单履行计划:订单采购决策和交付方式选择,以最大程度地减少与订单履行计划相关的成本。我们采用众包运输从本地商店进行最后一英里交付的新概念,其中包括基于众包托运人的不同特征的两种特定的交付方法:信息共享驱动程序(ISD)和临时驱动程序(OD)。我们设计了一种动态编程模型,用于在滚动视野框架中实现订单,该数学模型后来在数学上近似为混合整数线性规划模型。该模型同时考虑当前收到的订单和预测的未来需求,以做出使立即交付成本加最终的预期成本最小化的订单分配决策。它会按照时间表反复求解模型,以便从本地商店构建最佳的履行计划。借助滚动层结构,我们还引入了反馈控制系统来应对对未来需求的不准确预测。最后,我们证明了在完美信息下,所提出的公式可以收敛到全局最优。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号