Dynamic Order-Driver Matching Framework Design for Crowd-Sourced Delivery Considering the Drivers’ Acceptance Uncertainties
In this paper, we consider a crowd-sourced delivery system where in-store customers, as the supplement to a professional fleet, deliver online orders while on their way home. This system operates in a dynamic and stochastic setting: both in-store customers and online orders arrive continuously throughout the day, and the in-store customers are free to decide whether to accept or reject the assigned online orders. To address the inherent matching challenges presented in this system, we propose a two-stage dynamic order-driver matching framework, which processes an order postponing algorithm integrating the concept of “Value of Time” and a formal matching and compensation decision process employing a well-designed binomial logit model to predict drivers’ order acceptance probability. Computational findings suggest that our method provides significant economic and societal advantages. Furthermore, we delve into how varying environmental factors influence the performance of our approach.
Authors
- Jie Gao (ORCID: https://orcid.org/0000-0002-4066-4894)
- Shixuan Hou (ORCID: https://orcid.org/0000-0003-1783-7088)
- Chun Wang (ORCID: https://orcid.org/0000-0003-2634-4795)
Institutions
- Concordia University (US)
- Delft University of Technology (NL)
Publication Details
- Published
- 2024-12-11
- DOI
- https://doi.org/10.1061/9780784485484.268
- Primary Topic
- Transportation and Mobility Innovations
- Type
- article
- Field-Weighted Citation Impact
- 0.00