EconPapers    
Economics at your fingertips  
 

Dynamic assignment of delivery order bundles to in-store customers

Simona Mancini, Marlin W. Ulmer and Margaretha Gansterer

Omega, 2025, vol. 133, issue C

Abstract: Many larger grocery stores offer home delivery services. However, the delivery cost is usually high and such services are rarely profitable. One way of reducing cost is by outsourcing some orders to in-store customers for a compensation. While initially single orders were dynamically assigned to customers, companies started exploring the assignment of order bundles instead to reduce per-order compensation and exploit consolidation potential. We investigate the value of dynamic assignment of bundles in this work. To this end, we consider a setting where all orders are known and, over time, unknown in-store customers enter the system for a short time and offer transportation of bundles of orders for compensation. The store decides dynamically which bundle to assign to which in-store customer (if any). At the end of the time horizon, the remaining orders are delivered by a dedicated fleet of store employees. The goal of the store is to minimize the compensation prices together with the delivery cost. We propose a threshold-based policy with scenario-based tuning. Popularity and compensation price thresholds are determined a priori by solving a set of perfect information scenarios. In every state, bundles are only assigned if they are popular enough and the compensation is comparably low. The thresholds (i.e., popularity threshold and compensation threshold) are adapted over time to account for the decrease in assignment opportunities. We show the effectiveness of our policy in a comprehensive computational study and highlight the value of bundle assignments compared to assigning individual orders. We further show that our strategy not only reduces the compensation paid to in-store customers but also the final routing cost.

Keywords: Crowdsourcing; Order bundling; Sequential decision making; Approximate dynamic programming (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S030504832400210X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:133:y:2025:i:c:s030504832400210x

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

DOI: 10.1016/j.omega.2024.103246

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().

 
Page updated 2025-03-19
Handle: RePEc:eee:jomega:v:133:y:2025:i:c:s030504832400210x