2018/05/14 by Junyu Cao, Cao, Junyu, Mariana Olvera‐Cravioto +3
Engineering · #60G55 #FOS: Mathematics #Optimization and Control (math.OC) #Primary: 60F10 #Probability (math.PR) #Transportation and Mobility Innovations #Urban and Freight Transport Logistics #Vehicle Routing Optimization Methods #secondary: 60C05
paper · pdf · doi:10.48550/arxiv.1805.05012
openalex publication_date 2018/05/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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, where bundles of packages are picked up from the warehouse at random times during the interval [0, T]. Our theoretical results include both exact and asymptotic (as n → ∞) expressions for the expected number of packages that will be picked up by time T, and are closely related to the classical Renyi's parking/packing problem.