亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
清影完成签到,获得积分10
刚刚
铠甲勇士发布了新的文献求助10
2秒前
jkj发布了新的文献求助10
3秒前
Akim应助科研通管家采纳,获得10
6秒前
11秒前
圣光完成签到,获得积分10
14秒前
十亩间发布了新的文献求助10
15秒前
21秒前
香蕉觅云应助十亩间采纳,获得10
24秒前
CipherSage应助铠甲勇士采纳,获得10
25秒前
田玲念完成签到,获得积分10
25秒前
小叶曲发布了新的文献求助10
29秒前
js完成签到 ,获得积分10
30秒前
绿猪完成签到,获得积分10
33秒前
情怀应助落寞的笑寒采纳,获得10
33秒前
标致的大船完成签到,获得积分10
35秒前
科研通AI6.3应助jkj采纳,获得30
37秒前
38秒前
39秒前
优美的谷完成签到,获得积分10
40秒前
小叶曲完成签到,获得积分10
40秒前
不想看文献完成签到 ,获得积分10
43秒前
43秒前
44秒前
希望天下0贩的0应助chenchen采纳,获得10
44秒前
45秒前
铠甲勇士发布了新的文献求助10
47秒前
jjjjjjn发布了新的文献求助10
47秒前
是小袁呀完成签到 ,获得积分10
55秒前
jjjjjjn完成签到,获得积分10
55秒前
56秒前
jkj发布了新的文献求助30
59秒前
59秒前
1分钟前
几一昂完成签到 ,获得积分10
1分钟前
1分钟前
1分钟前
饱满含玉完成签到,获得积分10
1分钟前
1分钟前
1分钟前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
Pediatric Dermoscopy Trichoscopy & Onychoscopy 1000
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 700
Matrix Methods in Data Mining and Pattern Recognition Second Edition 610
International Security Studies and Technology :Approaches, Assessments, and Frontiers 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7571514
求助须知:如何正确求助?哪些是违规求助? 9151071
关于积分的说明 19572751
捐赠科研通 7156509
什么是DOI,文献DOI怎么找? 3264048
关于科研通互助平台的介绍 2429372
邀请新用户注册赠送积分活动 2254211