Logo image
Back
Policies for the dynamic same-day delivery problem with walking and parking
Journal article   Open access   Peer reviewed

Policies for the dynamic same-day delivery problem with walking and parking

Ninja Scherr, Sara Reed, Ann Melissa Campbell and Barrett W. Thomas
Transportation research. Part E, Logistics and transportation review, Vol.212, 104898
08/2026
DOI: 10.1016/j.tre.2026.104898
url
https://doi.org/10.1016/j.tre.2026.104898View
Published (Version of record) Open Access

Abstract

•We describe the Dynamic Same-Day Delivery Problem with Walking and Parking.•We model the problem as MDP and propose waiting-based policies.•In a computational study, we show the impact of waiting and parking on profit. A key decision in the dynamic setting of same-day delivery is when to dispatch the vehicle and provide last-mile delivery service to continuously arriving customer requests. To understand successful strategies in urban environments, we introduce the Same-Day Delivery Problem with Walking and Parking (SDDPWP). We model this problem as a Markov Decision Process and develop solution policies that consider waiting for customers to accumulate and specified consolidation levels at parking spots. Our computational results clearly demonstrate that including parking and walking times matter in same-day delivery, with the best solutions recommending drivers wait at the depot to achieve consolidation of multiple customers into walking routes from each parking spot. We find a significant percentage of waiting time occurs at the beginning of the day and provide managerial insights as to how to mitigate this inefficiency in labor utilization to improve profits by as much as 60%.
 Last-mile Parking Routing Same-day delivery

Details

Metrics

1 Record Views
Logo image