Workforce Scheduling in the Era of Crowdsourced Delivery

2020 ◽  
Vol 54 (4) ◽  
pp. 1113-1133
Author(s):  
Marlin Ulmer ◽  
Martin Savelsbergh

Using crowdsourced delivery capacity, that is, individuals offering their vehicle and their time to perform deliveries, can allow companies to provide faster delivery options and more easily accommodate fluctuations in demand. However, because of the uncertainty associated with crowdsourced delivery capacity, ensuring service quality is more challenging. To prevent or mitigate any negative effects of the uncertainty associated with crowdsourced delivery capacity, companies may choose to also have a scheduled delivery workforce that they can control more effectively. We investigate continuous approximation and value function approximation methods for scheduling this workforce, that is, deciding their shifts (start time and duration) to achieve a service level target at minimum cost. An extensive computational study demonstrates the efficacy of our methods and provides insights into the use of crowdsourced delivery capacity.

2020 ◽  
Vol 54 (4) ◽  
pp. 1016-1033 ◽  
Author(s):  
Marlin W. Ulmer

An increasing number of e-commerce retailers offers same-day delivery. To deliver the ordered goods, providers dynamically dispatch a fleet of vehicles transporting the goods from the warehouse to the customers. In many cases, retailers offer different delivery deadline options, from four-hour delivery up to next-hour delivery. Due to the deadlines, vehicles often only deliver a few orders per trip. The overall number of served orders within the delivery horizon is small and the revenue low. As a result, many companies currently struggle to conduct same-day delivery cost-efficiently. In this paper, we show how dynamic pricing is able to substantially increase both revenue and the number of customers we are able to serve the same day. To this end, we present an anticipatory pricing and routing policy (APRP) method that incentivizes customers to select delivery deadline options efficiently for the fleet to fulfill. This maintains the fleet’s flexibility to serve more future orders. We model the respective pricing and routing problem as a Markov decision process (MDP). To apply APRP, the state-dependent opportunity costs per customer and option are required. To this end, we use a guided offline value function approximation (VFA) based on state space aggregation. The VFA approximates the opportunity cost for every state and delivery option with respect to the fleet’s flexibility. As an offline method, APRP is able to determine suitable prices instantly when a customer orders. In an extensive computational study, we compare APRP with a policy based on fixed prices and with conventional temporal and geographical pricing policies. APRP outperforms the benchmark policies significantly, leading to both a higher revenue and more customers served the same day.


2008 ◽  
Vol 25 (3) ◽  
pp. 287-304 ◽  
Author(s):  
Masashi Sugiyama ◽  
Hirotaka Hachiya ◽  
Christopher Towell ◽  
Sethu Vijayakumar

2014 ◽  
Vol 15 (3) ◽  
pp. 223-231 ◽  
Author(s):  
Feng-fei Zhao ◽  
Zheng Qin ◽  
Zhuo Shao ◽  
Jun Fang ◽  
Bo-yan Ren

Sign in / Sign up

Export Citation Format

Share Document