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秒前
1秒前
qwadee应助ahau_zhang采纳,获得10
1秒前
江楠发布了新的文献求助10
2秒前
course发布了新的文献求助10
2秒前
无可瞿代完成签到,获得积分20
5秒前
5秒前
5秒前
Ming完成签到,获得积分0
5秒前
李爱国应助xiaoyun采纳,获得10
6秒前
yang完成签到 ,获得积分10
6秒前
impgod完成签到,获得积分10
9秒前
难过盼海发布了新的文献求助10
10秒前
不安魂幽发布了新的文献求助10
11秒前
无可瞿代发布了新的文献求助10
11秒前
JamesPei应助孔乙己采纳,获得10
11秒前
爆米花应助学术牛马采纳,获得10
13秒前
小二郎应助索多玛采纳,获得10
15秒前
mtfx完成签到 ,获得积分10
17秒前
17秒前
19秒前
19秒前
19秒前
20秒前
course发布了新的文献求助10
20秒前
淳于汲完成签到 ,获得积分10
21秒前
22秒前
烟消云散完成签到,获得积分10
22秒前
房千易发布了新的文献求助10
24秒前
zzzz完成签到 ,获得积分10
25秒前
Maytail完成签到,获得积分10
25秒前
25秒前
小马甲应助蜗牛星星采纳,获得10
26秒前
矛盾空间发布了新的文献求助10
26秒前
孔乙己发布了新的文献求助10
26秒前
course发布了新的文献求助10
27秒前
轩辕完成签到 ,获得积分10
27秒前
宇文天思完成签到,获得积分10
27秒前
Orange应助Cgy采纳,获得10
28秒前
28秒前
高分求助中
Cronologia da história de Macau 5000
Merrill's Atlas of Radiographic Positioning and Procedures - 3-Volume Set, 16th Edition 2000
Interactions of Vowel Quality and Prosody in East Slavic 500
Vander's Renal Physiology第10版 500
CLSI M27M44S Performance Standards for Antifungal Susceptibility Testing of Yeasts Fourth Edition 400
Python for Chemists 400
Analytical Separation Science 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7116862
求助须知:如何正确求助?哪些是违规求助? 8769926
关于积分的说明 18545286
捐赠科研通 6688834
什么是DOI,文献DOI怎么找? 3146449
关于科研通互助平台的介绍 2263827
邀请新用户注册赠送积分活动 2121064