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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
2秒前
俊秀的伟祺关注了科研通微信公众号
2秒前
酷波er应助木南采纳,获得10
2秒前
leiyang发布了新的文献求助30
2秒前
芒果椰椰发布了新的文献求助10
3秒前
科研通AI6.4应助仔拉采纳,获得10
4秒前
4秒前
Jasper应助木南采纳,获得10
4秒前
cuckovo发布了新的文献求助10
4秒前
4秒前
5秒前
庸人自扰发布了新的文献求助10
5秒前
thezwt完成签到,获得积分10
6秒前
阳光的天与完成签到,获得积分10
6秒前
科研通AI6.2应助zxy采纳,获得10
6秒前
7秒前
王兵完成签到,获得积分20
7秒前
简单发布了新的文献求助30
7秒前
Yong完成签到,获得积分10
8秒前
栉风沐雨完成签到,获得积分10
8秒前
猛猛冲完成签到,获得积分10
8秒前
真的OK发布了新的文献求助10
9秒前
清风完成签到 ,获得积分10
9秒前
王兵发布了新的文献求助10
9秒前
无韶的月亮树完成签到 ,获得积分10
10秒前
装饭的桶完成签到,获得积分10
10秒前
11秒前
hhhh发布了新的文献求助10
11秒前
香蕉觅云应助无名的人采纳,获得10
11秒前
慕青应助dawn采纳,获得10
12秒前
科目三应助加油采纳,获得10
12秒前
微笑子慧发布了新的文献求助10
12秒前
12秒前
科研通AI6.4应助勇哥你好采纳,获得10
13秒前
情怀应助王兵采纳,获得10
15秒前
晓倩发布了新的文献求助10
15秒前
合法的天空完成签到,获得积分10
15秒前
CipherSage应助将1采纳,获得10
15秒前
一辉完成签到 ,获得积分10
15秒前
万万没想到完成签到,获得积分10
17秒前
高分求助中
Principles of Economics, 11th Edition 10000
University Physics with Modern Physics, 16th edition 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Environmental Leverage in Times of Climate Crisis: Product Standards, Carbon Border Measures and Preferential Trade Agreements 1000
Matrix Methods in Data Mining and Pattern Recognition 510
Social Skills Improvement System-Rating Scales--Chinese Version 500
Dynamische Polarisation von H-1 und B-11 in (CH-3)-3NBH-3 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7243408
求助须知:如何正确求助?哪些是违规求助? 8867663
关于积分的说明 18706012
捐赠科研通 6917719
什么是DOI,文献DOI怎么找? 3196581
关于科研通互助平台的介绍 2370231
邀请新用户注册赠送积分活动 2171207