Approximate dynamic programming for pickup and delivery problem with crowd-shipping
We study a variant of dynamic pickup and delivery crowd-shipping operation for delivering online orders within a few hours from a brick-and-mortar store. This crowd-shipping operation is subject to a high degree of uncertainty due to the stochastic arrival of online orders and crowd-shippers that im...
Saved in:
| Published in: | Transportation research. Part B: methodological Vol. 187; p. 103027 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.09.2024
|
| Subjects: | |
| ISSN: | 0191-2615 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We study a variant of dynamic pickup and delivery crowd-shipping operation for delivering online orders within a few hours from a brick-and-mortar store. This crowd-shipping operation is subject to a high degree of uncertainty due to the stochastic arrival of online orders and crowd-shippers that impose several challenges for efficient matching of orders to crowd-shippers. We formulate the problem as a Markov decision process and develop an Approximate Dynamic Programming (ADP) policy using value function approximation for obtaining a highly scalable and real-time matching strategy while considering temporal and spatial uncertainty in arrivals of online orders and crowd-shippers. We incorporate several algorithmic enhancements to the ADP algorithm, which significantly improve the convergence. We compare the ADP policy with an optimization-based myopic policy using various performance measures. Our numerical analysis with varying parameter settings shows that ADP policies can lead to up to 25.2% cost savings and a 9.8% increase in the number of served orders. Overall, we find that our proposed framework can guide crowd-shipping platforms for efficient real-time matching decisions and enhance the platform delivery capacity.
•A pickup and delivery crowd-shipping operation for same-day delivery is introduced.•Uncertainty in the arrival of crowd-shippers and online orders is incorporated.•An approximate dynamic programming policy for real-time matching is introduced.•Several enhancements for off-line learning of value functions are incorporated.•Numerical experiments provide managerial insights on various performance measures. |
|---|---|
| ISSN: | 0191-2615 |
| DOI: | 10.1016/j.trb.2024.103027 |