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 被引量:28
标识
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秒前
可乐发布了新的文献求助10
1秒前
林夕发布了新的文献求助10
1秒前
3秒前
3秒前
alixyue应助MaoXinLei采纳,获得50
4秒前
4秒前
潇洒的牛青完成签到,获得积分20
4秒前
精明羊青完成签到,获得积分20
4秒前
酥酥完成签到,获得积分10
5秒前
NexusExplorer应助ZLHS采纳,获得10
5秒前
5秒前
冷傲乌完成签到,获得积分20
5秒前
潇潇木子发布了新的文献求助10
6秒前
CodeCraft应助kang采纳,获得10
6秒前
kong完成签到,获得积分10
6秒前
7秒前
丘比特应助激动的元瑶采纳,获得10
9秒前
9秒前
9秒前
9秒前
10秒前
10秒前
幺幺咔完成签到 ,获得积分10
12秒前
Mike发布了新的文献求助50
13秒前
如意书包完成签到,获得积分10
14秒前
科研通AI6.3应助chelsea采纳,获得10
14秒前
隐形曼青应助可乐采纳,获得10
14秒前
14秒前
汉朝来的馒头完成签到,获得积分10
14秒前
彭于晏应助舒心的雍采纳,获得10
15秒前
15秒前
潇潇木子完成签到,获得积分10
15秒前
小蘑菇应助xiao采纳,获得10
15秒前
N11完成签到,获得积分10
15秒前
15秒前
17秒前
舒心的雍完成签到,获得积分20
17秒前
18秒前
小羊给银鱼在游的求助进行了留言
18秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
AnnualResearch andConsultation Report of Panorama survey and Investment strategy onChinaIndustry 1000
機能性マイクロ細孔・マイクロ流体デバイスを利用した放射性核種の 分離・溶解・凝集挙動に関する研究 1000
卤化钙钛矿人工突触的研究 1000
Engineering for calcareous sediments : proceedings of the International Conference on Calcareous Sediments, Perth 15-18 March 1988 / edited by R.J. Jewell, D.C. Andrews 1000
Continuing Syntax 1000
Harnessing Lymphocyte-Cytokine Networks to Disrupt Current Paradigms in Childhood Nephrotic Syndrome Management: A Systematic Evidence Synthesis 700
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6259362
求助须知:如何正确求助?哪些是违规求助? 8081507
关于积分的说明 16885192
捐赠科研通 5331222
什么是DOI,文献DOI怎么找? 2837941
邀请新用户注册赠送积分活动 1815319
关于科研通互助平台的介绍 1669241