亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人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 被引量: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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
情怀应助自然映梦采纳,获得10
7秒前
12秒前
舒服的如蓉完成签到,获得积分10
18秒前
涵de暴躁小地雷完成签到,获得积分10
19秒前
19秒前
九灶完成签到 ,获得积分10
21秒前
bji完成签到,获得积分10
25秒前
camera发布了新的文献求助10
26秒前
41秒前
42秒前
大模型应助科研通管家采纳,获得10
42秒前
yangjinru完成签到 ,获得积分10
43秒前
Hello应助可爱慕卉采纳,获得10
46秒前
无花果应助忐忑的棉花糖采纳,获得10
50秒前
彭于晏应助光亮的冷亦采纳,获得10
51秒前
陶醉巧凡发布了新的文献求助10
53秒前
59秒前
852应助风花雪月采纳,获得10
1分钟前
1分钟前
1分钟前
JamesPei应助现代的芙蓉采纳,获得10
1分钟前
霸气皓轩完成签到 ,获得积分10
1分钟前
可爱慕卉发布了新的文献求助10
1分钟前
1分钟前
1分钟前
Esther发布了新的文献求助10
1分钟前
1分钟前
小蘑菇应助顺利秋灵采纳,获得10
1分钟前
北欧森林完成签到,获得积分10
1分钟前
1分钟前
rengar完成签到,获得积分10
1分钟前
1分钟前
梁钋瑞完成签到 ,获得积分20
1分钟前
1分钟前
顺利秋灵发布了新的文献求助10
1分钟前
顺利秋灵完成签到,获得积分20
2分钟前
科研通AI6.3应助学者11111采纳,获得10
2分钟前
2分钟前
学者11111发布了新的文献求助10
2分钟前
科研通AI6.3应助学者11111采纳,获得10
2分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Modern Epidemiology, Fourth Edition 5000
Handbook of pharmaceutical excipients, Ninth edition 5000
Digital Twins of Advanced Materials Processing 2000
Weaponeering, Fourth Edition – Two Volume SET 2000
Polymorphism and polytypism in crystals 1000
Social Cognition: Understanding People and Events 800
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 纳米技术 有机化学 物理 生物化学 化学工程 计算机科学 复合材料 内科学 催化作用 光电子学 物理化学 电极 冶金 遗传学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 6027671
求助须知:如何正确求助?哪些是违规求助? 7679335
关于积分的说明 16185657
捐赠科研通 5175123
什么是DOI,文献DOI怎么找? 2769225
邀请新用户注册赠送积分活动 1752618
关于科研通互助平台的介绍 1638422