Last-mile shared delivery: a discrete sequential packing approach

DOI10.1287/MOOR.2019.1039MaRDI QIDQ3387932zbMATH OpenOpenAlexFDO

Authors

Publication date 8 January 2021

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1805.05012

zbMATH Keywords

asymptotic analysistraveling salesman problemcapacitated vehicle routing problemshared mobilitylast-mile deliverydiscrete sequential packingRényi's parking problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Combinatorial probability (60C05) Transportation, logistics and supply chain management (90B06)

Abstract: 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 $noinfty$) 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.

Recommendations

• A truck and drones model for last-mile delivery: a mathematical model and heuristic approach
• A data-driven compensation scheme for last-mile delivery with crowdsourcing
• Vehicle routing with private and shared delivery locations
• The share-a-ride problem: people and parcels sharing taxis
• A generalized bin packing problem for parcel delivery in last-mile logistics

Cites work

• scientific article; zbMATH DE number 3151126 (Why is no real title available?)
• scientific article; zbMATH DE number 3171475 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
• Bounds and Heuristics for Capacitated Routing Problems
• Genetic algorithms for the traveling salesman problem
• How Long Can a Euclidean Traveling Salesman Tour Be?
• Incorporating inventory and routing costs in strategic location models
• On the long edges in the shortest tour through \(n\) random points
• Ordinary differential equations: basics and beyond
• Packing random intervals on-line
• Probability. Theory and examples.
• Problems from the discrete to the continuous. Probability, number theory, graph theory, and combinatorics
• Quantizers ad the worst case Euclidean traveling salesman problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Rényi's parking problem revisited
• The share-a-ride problem: people and parcels sharing taxis
• The vehicle routing problem
• The vehicle routing problem. Latest advances and new challenges.

Cited in

(6)

• A data-driven compensation scheme for last-mile delivery with crowdsourcing
• Learn global and optimize local: a data-driven methodology for last-mile routing
• Mathematical programming with stochastic equilibrium constraints applied to optimal last-mile delivery services
• Vehicle routing with private and shared delivery locations
• Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels
• A machine learning optimization approach for last-mile delivery and third-party logistics

This page was built for publication: Last-mile shared delivery: a discrete sequential packing approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387932)