Last-Mile Shared Delivery: A Discrete Sequential Packing Approach
| Autor: | Mariana Olvera-Cravioto, Zuo-Jun Max Shen, Junyu Cao |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Distribution center
050210 logistics & transportation Asymptotic analysis 021103 operations research Operations research Shared mobility General Mathematics Probability (math.PR) 05 social sciences 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Travelling salesman problem Computer Science Applications Optimization and Control (math.OC) 0502 economics and business FOS: Mathematics Last mile Primary: 60F10 secondary: 60C05 60G55 Mathematics - Optimization and Control Mathematics - Probability Mathematics |
| Zdroj: | Mathematics of Operations Research. 45:1466-1497 |
| ISSN: | 1526-5471 0364-765X |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|