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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Tain完成签到,获得积分10
2秒前
Onyx完成签到,获得积分10
2秒前
4秒前
4秒前
4秒前
Wangxiyao发布了新的文献求助10
4秒前
5秒前
6秒前
怡然奄发布了新的文献求助10
6秒前
打打应助滴滴答答采纳,获得10
6秒前
三三发布了新的文献求助10
7秒前
执着的立果完成签到,获得积分20
8秒前
8秒前
8秒前
9秒前
领导范儿应助天草诺采纳,获得20
9秒前
10秒前
10秒前
核桃发布了新的文献求助10
11秒前
12秒前
12秒前
万能图书馆应助Mr_chen采纳,获得10
13秒前
卧底玛雅应助书俭采纳,获得10
13秒前
13秒前
小马甲应助britteny采纳,获得30
14秒前
fans发布了新的文献求助10
15秒前
Zero发布了新的文献求助10
15秒前
ttgx发布了新的文献求助10
15秒前
小鱼儿发布了新的文献求助10
15秒前
16秒前
eulota发布了新的文献求助30
17秒前
17秒前
17秒前
18秒前
19秒前
十三发布了新的文献求助10
19秒前
19秒前
zzzy完成签到,获得积分10
21秒前
今后应助Mr_chen采纳,获得10
21秒前
HarrisonChan发布了新的文献求助10
22秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
2026年中国辛酸癸酸聚乙二醇甘油酯行业市场现状调查及投资机会研判报告 1000
模型平均及其应用 900
Nondestructive Testing Handbook: Vol. 4, Thermal and Infrared Testing (IR), 4th ed 800
Évora na Idade Média 555
作者名:Kristopher P. Plain,悉尼大学的,目前只能查到其四篇论文,想找到其博士论文 550
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7345526
求助须知:如何正确求助?哪些是违规求助? 8957710
关于积分的说明 19021701
捐赠科研通 6996810
什么是DOI,文献DOI怎么找? 3219976
关于科研通互助平台的介绍 2384901
邀请新用户注册赠送积分活动 2200245