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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
molihuakai应助无忧采纳,获得10
1秒前
JY发布了新的文献求助10
1秒前
2秒前
LJH完成签到,获得积分10
2秒前
3秒前
归一完成签到,获得积分10
3秒前
4秒前
4秒前
4秒前
mini发布了新的文献求助10
4秒前
4秒前
liu完成签到,获得积分10
4秒前
希望天下0贩的0应助xuxuux采纳,获得10
5秒前
VitoLi完成签到,获得积分10
5秒前
6秒前
科研通AI6.2应助岁岁年年采纳,获得10
6秒前
SATone完成签到,获得积分10
6秒前
lbk发布了新的文献求助10
7秒前
ding应助echo采纳,获得10
8秒前
九bai发布了新的文献求助10
8秒前
yaocx完成签到,获得积分10
8秒前
9秒前
凤儿完成签到,获得积分10
9秒前
10秒前
弟弟发布了新的文献求助10
10秒前
10秒前
AAA奉车时代张功完成签到,获得积分10
10秒前
思源应助自信的紫青采纳,获得10
11秒前
阿斌完成签到,获得积分10
11秒前
11秒前
英俊的铭应助冷艳的墨镜采纳,获得10
12秒前
JY完成签到,获得积分10
12秒前
王书妍发布了新的文献求助10
13秒前
Mniwl应助hou采纳,获得10
13秒前
13秒前
13秒前
码头整点薯条完成签到,获得积分10
14秒前
南枫发布了新的文献求助50
14秒前
14秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
晶种分解过程与铝酸钠溶液混合强度关系的探讨 8888
Les Mantodea de Guyane Insecta, Polyneoptera 2000
Chemistry and Physics of Carbon Volume 18 800
The Organometallic Chemistry of the Transition Metals 800
Leading Academic-Practice Partnerships in Nursing and Healthcare: A Paradigm for Change 800
Signals, Systems, and Signal Processing 610
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6421451
求助须知:如何正确求助?哪些是违规求助? 8240508
关于积分的说明 17513073
捐赠科研通 5475321
什么是DOI,文献DOI怎么找? 2892394
邀请新用户注册赠送积分活动 1868805
关于科研通互助平台的介绍 1706218