Arslan, Alp and Kilci, Firat and Cheng, Shih-Fen and Misra, Archan (2025) Choice-based Crowdshipping for Next-day Delivery Services : A Dynamic Task Display Problem. European Journal of Operational Research. ISSN 0377-2217 (In Press)
![[thumbnail of EJORChoice_4_]](https://eprints.lancs.ac.uk/style/images/fileicons/text.png)
EJORChoice_4_.pdf - Accepted Version
Available under License Creative Commons Attribution.
Download (849kB)
Abstract
This paper studies integrating the crowd workforce into next-day home delivery services. In this setting, both crowd drivers and contract drivers collaborate in making deliveries. Crowd drivers have limited capacity and can choose not to deliver if the presented tasks do not align with their preferences. The central question addressed is: How can the platform minimize the total task fulfilment cost, which includes payouts to crowd drivers and additional payouts to contract drivers for delivering the unselected tasks by customizing task displays to crowd drivers? To tackle this problem, we formulate it as a finite-horizon Stochastic Decision Problem, capturing crowd drivers’ utility-driven task preferences, with the option of not choosing a task based on the displayed options. An inherent challenge is approximating the non-constant marginal cost of serving orders not chosen by crowd drivers, which are then assigned to contract drivers. We address this by leveraging a common approximation technique, dividing the service region into zones. Furthermore, we devise a stochastic look-ahead strategy that tackles the curse of dimensionality issues arising in dynamic task display execution and a non-linear (problem specifically concave) boundary condition associated with the cost of hiring contract drivers. In experiments inspired by Singapore’s geography, we demonstrate that choice-based crowd shipping can reduce next-day delivery fulfilment costs by up to 16.9%. The observed cost savings are closely tied to the task display policies and the task choice behaviours of drivers.