Last-Mile Shared Delivery: A Discrete Sequential Packing Approach
Last-Mile Shared Delivery: A Discrete Sequential Packing Approach
复制标题
最后一英里共享交付：离散顺序包装方法
DOI：
10.1287/moor.2019.1039
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Z. Shen
中科院分区：
文献类型：
--
作者：
Junyu Cao;Mariana Olvera;Z. Shen
我们提出了一个模型，用于优化n个包裹从配送中心到最终收件人的最后一英里交付，该模型使用的策略是将乘车共享平台（例如优步或Lyft）与传统的内部面包车交付系统相结合。主要目标是计算n个包裹中每个包裹对私人司机的最优奖励，使运送所有包裹的总预期成本最小化。我们的技术方法是基于一个离散顺序包装问题的公式，在这个问题中，成捆的包裹在间隔期间随机时间从仓库中取出[公式：见文本]。我们的理论结果包括精确和渐近（如[公式：见文本]）表达式的期望数量的包裹被拿起的时间t。他们是密切相关的经典r<s:1>尼的停车/包装问题。我们建议的框架可以随着包的数量而扩展。
We propose a model for optimizing the last-mile delivery of n packages from a distribution center to their final recipients, using a strategy that combines the use of ride-sharing platforms (e.g., Uber or Lyft) with traditional in-house van delivery systems. The main objective is to compute the optimal reward offered to private drivers for each of the n packages such that the total expected cost of delivering all packages is minimized. Our technical approach is based on the formulation of a discrete sequential packing problem, in which bundles of packages are picked up from the warehouse at random times during the interval [Formula: see text]. Our theoretical results include both exact and asymptotic (as [Formula: see text]) expressions for the expected number of packages that are picked up by time T. They are closely related to the classical Rényi’s parking/packing problem. Our proposed framework is scalable with the number of packages.