Do it right the first time: Vehicle routing with home delivery attempt predictors

计算机科学 声誉 车辆路径问题 布线(电子设计自动化) 交易成本 样品(材料) 运筹学 运营管理 经济 微观经济学 工程类 计算机网络 社会科学 色谱法 社会学 化学
作者
Stanley Frederick W.T. Lim,Qingchen Wang,Scott Webster
出处
期刊:Production and Operations Management [Wiley]
卷期号:32 (4): 1262-1284 被引量:16
标识
DOI:10.1111/poms.13926
摘要

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.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
可爱的函函应助wrx_KGM采纳,获得10
刚刚
温婉的曼冬完成签到,获得积分10
1秒前
Hope发布了新的文献求助30
1秒前
四夕完成签到 ,获得积分10
2秒前
赘婿应助小肥羊采纳,获得10
2秒前
zzm完成签到,获得积分10
4秒前
orixero应助2240920060采纳,获得10
4秒前
一颗星发布了新的文献求助10
5秒前
purist完成签到,获得积分10
5秒前
8秒前
彪壮的青雪完成签到,获得积分10
8秒前
小二郎应助phl采纳,获得10
8秒前
8秒前
Fly完成签到,获得积分10
9秒前
10秒前
彭于晏应助一颗星采纳,获得10
10秒前
Yang发布了新的文献求助10
11秒前
脆啵啵马克宝完成签到,获得积分10
12秒前
Manzia完成签到,获得积分10
12秒前
zq发布了新的文献求助10
12秒前
852应助彪壮的青雪采纳,获得10
13秒前
14秒前
14秒前
16秒前
16秒前
17秒前
18秒前
曾无忧发布了新的文献求助10
18秒前
star发布了新的文献求助10
18秒前
丁丁完成签到 ,获得积分10
18秒前
着急的青枫应助NNUsusan采纳,获得20
18秒前
科研混子发布了新的文献求助10
19秒前
zq完成签到,获得积分10
19秒前
20秒前
20秒前
123完成签到,获得积分10
20秒前
香草哥完成签到,获得积分10
21秒前
23秒前
嘎嘎关注了科研通微信公众号
23秒前
24秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
解放军总医院眼科医学部病例精解 1000
温州医科大学附属眼视光医院斜弱视与双眼视病例精解 1000
Zur lokalen Geoidbestimmung aus terrestrischen Messungen vertikaler Schweregradienten 1000
Hidden Generalizations Phonological Opacity in Optimality Theory 500
translating meaning 500
Storie e culture della televisione 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 内科学 生物化学 物理 计算机科学 纳米技术 遗传学 基因 复合材料 化学工程 物理化学 病理 催化作用 免疫学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 4896403
求助须知:如何正确求助?哪些是违规求助? 4178074
关于积分的说明 12969799
捐赠科研通 3941347
什么是DOI,文献DOI怎么找? 2162226
邀请新用户注册赠送积分活动 1180680
关于科研通互助平台的介绍 1086242