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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
2秒前
踏实滑板发布了新的文献求助10
3秒前
3秒前
3秒前
7秒前
bkagyin应助开心易真采纳,获得10
7秒前
8秒前
8秒前
汉堡包应助everyone_woo采纳,获得10
8秒前
222666完成签到,获得积分10
8秒前
8秒前
9秒前
10秒前
科研通AI6.1应助insist采纳,获得10
10秒前
成就的冰双完成签到,获得积分10
10秒前
量子星尘发布了新的文献求助10
11秒前
牛帮帮完成签到,获得积分10
11秒前
朱朱完成签到,获得积分10
13秒前
yunzhetang完成签到,获得积分10
13秒前
夜雾格发布了新的文献求助10
13秒前
13秒前
花露水完成签到,获得积分20
13秒前
牛帮帮发布了新的文献求助10
14秒前
熙熙攘攘发布了新的文献求助10
14秒前
JamesPei应助吹什么风采纳,获得10
15秒前
Zhu发布了新的文献求助10
15秒前
shann完成签到,获得积分10
16秒前
16秒前
CodeCraft应助一行琉璃采纳,获得10
18秒前
18秒前
18秒前
20秒前
码头完成签到 ,获得积分10
21秒前
123发布了新的文献求助10
22秒前
HUYAOWEI发布了新的文献求助10
22秒前
111发布了新的文献求助10
23秒前
23秒前
传奇3应助超帅听枫采纳,获得10
24秒前
田様应助luren采纳,获得10
24秒前
25秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Burger's Medicinal Chemistry, Drug Discovery and Development, Volumes 1 - 8, 8 Volume Set, 8th Edition 1800
Cronologia da história de Macau 1600
Contemporary Debates in Epistemology (3rd Edition) 1000
International Arbitration Law and Practice 1000
文献PREDICTION EQUATIONS FOR SHIPS' TURNING CIRCLES或期刊Transactions of the North East Coast Institution of Engineers and Shipbuilders第95卷 1000
BRITTLE FRACTURE IN WELDED SHIPS 1000
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 纳米技术 计算机科学 化学工程 生物化学 物理 复合材料 内科学 催化作用 物理化学 光电子学 细胞生物学 基因 电极 遗传学
热门帖子
关注 科研通微信公众号,转发送积分 6156365
求助须知:如何正确求助?哪些是违规求助? 7984855
关于积分的说明 16593448
捐赠科研通 5266373
什么是DOI,文献DOI怎么找? 2810049
邀请新用户注册赠送积分活动 1790280
关于科研通互助平台的介绍 1657587