TY - JOUR
T1 - Do it right the first time
T2 - Vehicle routing with home delivery attempt predictors
AU - Lim, Stanley Frederick W.T.
AU - Wang, Qingchen
AU - Webster, Scott
N1 - Funding Information:
The authors thank Jinjia Huang at National University of Singapore, Sheng Liu at University of Toronto, Antonio Moreno at Harvard Business School, Mark Poon at Amazon, and Xuanming Su at University of Pennsylvania, as well as seminar participants at The University of Hong Kong for helpful comments on an earlier version of this manuscript. The authors also thank the department editor Sunil Mithas, the anonymous associate editor, and the two reviewers for constructive reviews.
Publisher Copyright:
© 2022 Production and Operations Management Society.
PY - 2023/4
Y1 - 2023/4
N2 - Up to 20% of all business-to-consumer deliveries fail on the first attempt. Failed deliveries not only carry cost implications but also incur damage to retailers’ brand reputation. Despite its economic significance, research has paid little attention to delivery attempt as an operational outcome or seldom accounted for its effects in routing models. This is partly due to the many factors that can influence delivery outcomes. We address this knowledge gap by first demonstrating that failed delivery attempts can be reasonably predicted using common routing, demand, environmental, and market attributes at both the individual package and route levels. For model-building, we use transaction data from an e-commerce retailer in South America. We then explore the value of accounting for failed delivery attempts in routing models. We propose a two-stage greedy algorithm for solving large problem instances. Our analysis indicates that not accounting for the probability of failed attempts in routing models may create a significant downward bias in the total cost of delivery. The analysis also suggests that manipulating the sequence in which packages in a route are delivered can be a cost-efficient lever that firms can employ at almost zero cost to profoundly affect delivery outcomes. We replicate the prediction model to a new sample from a delivery company in Singapore and calibrate it for a randomized field experiment to validate our algorithm's performance. Packages and drivers are randomly assigned to either our algorithm or the focal company's existing algorithm. Results suggest that our algorithm, on average, reduces the share of failed delivery attempts by 10% and the total cost of delivery by $13 per route. We further propose drivers’ discretionary work effort and the goal-gradient hypothesis as a mechanism for the efficacy of our algorithm. Controlling for time of day and other fixed effects, we empirically find that packages assigned to slots later in the route tend to have a lower failure rate because drivers display a higher degree of discretionary work effort toward the end of a route. Our approach can be applied to other firms’ last-mile delivery operations to improve their delivery execution.
AB - Up to 20% of all business-to-consumer deliveries fail on the first attempt. Failed deliveries not only carry cost implications but also incur damage to retailers’ brand reputation. Despite its economic significance, research has paid little attention to delivery attempt as an operational outcome or seldom accounted for its effects in routing models. This is partly due to the many factors that can influence delivery outcomes. We address this knowledge gap by first demonstrating that failed delivery attempts can be reasonably predicted using common routing, demand, environmental, and market attributes at both the individual package and route levels. For model-building, we use transaction data from an e-commerce retailer in South America. We then explore the value of accounting for failed delivery attempts in routing models. We propose a two-stage greedy algorithm for solving large problem instances. Our analysis indicates that not accounting for the probability of failed attempts in routing models may create a significant downward bias in the total cost of delivery. The analysis also suggests that manipulating the sequence in which packages in a route are delivered can be a cost-efficient lever that firms can employ at almost zero cost to profoundly affect delivery outcomes. We replicate the prediction model to a new sample from a delivery company in Singapore and calibrate it for a randomized field experiment to validate our algorithm's performance. Packages and drivers are randomly assigned to either our algorithm or the focal company's existing algorithm. Results suggest that our algorithm, on average, reduces the share of failed delivery attempts by 10% and the total cost of delivery by $13 per route. We further propose drivers’ discretionary work effort and the goal-gradient hypothesis as a mechanism for the efficacy of our algorithm. Controlling for time of day and other fixed effects, we empirically find that packages assigned to slots later in the route tend to have a lower failure rate because drivers display a higher degree of discretionary work effort toward the end of a route. Our approach can be applied to other firms’ last-mile delivery operations to improve their delivery execution.
KW - discretionary work effort
KW - field experiment
KW - goal-gradient hypothesis
KW - home delivery attempt
KW - online retailing
KW - vehicle routing
UR - http://www.scopus.com/inward/record.url?scp=85145729811&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85145729811&partnerID=8YFLogxK
U2 - 10.1111/poms.13926
DO - 10.1111/poms.13926
M3 - Article
AN - SCOPUS:85145729811
SN - 1059-1478
VL - 32
SP - 1262
EP - 1284
JO - Production and Operations Management
JF - Production and Operations Management
IS - 4
ER -