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秒前
1秒前
cslc发布了新的文献求助30
1秒前
为你比拟发布了新的文献求助10
2秒前
3秒前
3秒前
赵芳发布了新的文献求助10
5秒前
harry发布了新的文献求助10
5秒前
xiao发布了新的文献求助10
6秒前
今后应助qq采纳,获得10
7秒前
8秒前
张菲菲完成签到,获得积分10
8秒前
8秒前
harry完成签到 ,获得积分10
9秒前
minifox完成签到,获得积分10
10秒前
RR发布了新的文献求助10
10秒前
10秒前
11秒前
哈哈完成签到,获得积分10
11秒前
欢呼妙菱发布了新的文献求助10
13秒前
科研通AI6.3应助张菲菲采纳,获得10
13秒前
Benedict发布了新的文献求助10
13秒前
14秒前
千空应助valith采纳,获得10
14秒前
羡羡完成签到,获得积分20
15秒前
15秒前
16秒前
17秒前
17秒前
一二完成签到,获得积分10
17秒前
18秒前
18秒前
19秒前
ICBC完成签到 ,获得积分10
20秒前
Lucas应助跳跃飞瑶采纳,获得10
21秒前
孟昊如完成签到,获得积分10
21秒前
无花果应助肯德鸭采纳,获得10
21秒前
123发布了新的文献求助10
21秒前
cl完成签到,获得积分10
21秒前
玖拾贰发布了新的文献求助10
21秒前
高分求助中
The Wiley Blackwell Companion to Diachronic and Historical Linguistics 3000
HANDBOOK OF CHEMISTRY AND PHYSICS 106th edition 1000
ASPEN Adult Nutrition Support Core Curriculum, Fourth Edition 1000
AnnualResearch andConsultation Report of Panorama survey and Investment strategy onChinaIndustry 1000
Decentring Leadership 800
Signals, Systems, and Signal Processing 610
GMP in Practice: Regulatory Expectations for the Pharmaceutical Industry 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6286723
求助须知:如何正确求助?哪些是违规求助? 8105478
关于积分的说明 16952568
捐赠科研通 5352060
什么是DOI,文献DOI怎么找? 2844237
邀请新用户注册赠送积分活动 1821614
关于科研通互助平台的介绍 1677853