Machine Learning for Data-Driven Last-Mile Delivery Optimization

计算机科学 背景(考古学) 启发式 机器学习 联营 人工智能 帕累托原理 数据挖掘 数学优化 数学 古生物学 生物 操作系统
作者
Sami Serkan Özarık,Paulo da Costa,Alexandre M. Florio
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
卷期号:58 (1): 27-44 被引量:33
标识
DOI:10.1287/trsc.2022.0029
摘要

In the context of the Amazon Last-Mile Routing Research Challenge, this paper presents a machine-learning framework for optimizing last-mile delivery routes. Contrary to most routing problems where an objective function is clearly defined, in the real-world setting considered in the challenge, an objective is not explicitly specified and must be inferred from data. Leveraging techniques from machine learning and classical traveling salesman problem heuristics, we propose a “pool and select” algorithm to prescribe high-quality last-mile delivery sequences. In the pooling phase, we exploit structural knowledge acquired from data, such as common entry and exit regions observed in training routes. In the selection phase, we predict the scores of candidate sequences with a high-dimensional, pretrained, and regularized regression model. The score prediction model, which includes a large number of predictor variables such as sequence duration, compliance with time windows, earliness, lateness, and structural similarity to training data, displays good prediction accuracy and guides the selection of efficient delivery sequences. Overall, the framework is able to prescribe competitive delivery routes, as measured on out-of-sample routes across several data sets. Given that desired characteristics of high-quality sequences are learned and not assumed, the proposed framework is expected to generalize well to last-mile applications beyond those immediately foreseen in the challenge. Moreover, the method requires less than three seconds to prescribe a sequence given an instance and, thus, is suitable for very large-scale applications. History: This paper has been accepted for the Transportation Science Special Issue on Machine Learning Methods and Applications in Large-Scale Route Planning Problems. Funding: This research was funded by The Dutch Research Council (NWO) Data2Move project under [Grant 628.009.013] and the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie [Grant 754462]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.0029 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
wanci应助明晚吧采纳,获得10
2秒前
hky发布了新的文献求助20
2秒前
彭于晏应助rio采纳,获得10
4秒前
风格化橙发布了新的文献求助10
4秒前
GALN完成签到 ,获得积分10
5秒前
CipherSage应助寒冷的语蝶采纳,获得10
5秒前
琼墨发布了新的文献求助10
5秒前
BOB完成签到 ,获得积分10
5秒前
zhengzehong完成签到,获得积分10
7秒前
科目三应助何首乌采纳,获得10
8秒前
神烦狗完成签到,获得积分10
8秒前
清酒甘茶完成签到,获得积分10
8秒前
旺旺碎冰冰完成签到,获得积分10
9秒前
yao完成签到,获得积分10
9秒前
10秒前
今后应助一心扑在搞学术采纳,获得10
10秒前
陆小果完成签到,获得积分10
10秒前
hy完成签到 ,获得积分10
11秒前
12秒前
12秒前
Gyy发布了新的文献求助10
12秒前
ChiahaoKuo完成签到 ,获得积分10
12秒前
黄紫红完成签到 ,获得积分10
12秒前
rio发布了新的文献求助10
15秒前
Orange应助邢现良采纳,获得10
16秒前
16秒前
风格化橙发布了新的文献求助10
17秒前
小方啦啦啦完成签到,获得积分10
18秒前
18秒前
18秒前
Rainyin给Rainyin的求助进行了留言
19秒前
科研通AI6.4应助zz采纳,获得10
20秒前
阔达的背包完成签到 ,获得积分10
20秒前
科目三应助傲娇尔安采纳,获得10
20秒前
隐形曼青应助ycd采纳,获得10
20秒前
21秒前
22秒前
22秒前
标致远锋完成签到 ,获得积分10
22秒前
高分求助中
The Graphene Handbook (2019 Edition) 800
IEST-RP-CC018: Cleanroom Cleaning and Sanitization: Operating and Monitoring Procedures 600
Fundamentals of Pharmaceutical and Biologics Regulations: A Global Perspective, Second Edition 600
久松真一著作集〈第5巻〉禅と芸術 500
Fundamentals of Modern Mathematics: A Practical Review (Dover Books on Mathematics) 500
Cold War Transcended: Australia's China Policy, 1949-1990 470
Comprehensive Organic Synthesis 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6596932
求助须知:如何正确求助?哪些是违规求助? 8366841
关于积分的说明 17909700
捐赠科研通 5749694
什么是DOI,文献DOI怎么找? 2953219
邀请新用户注册赠送积分活动 1928537
关于科研通互助平台的介绍 1822447