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
1秒前
1秒前
左岸完成签到,获得积分10
1秒前
KuchA完成签到,获得积分10
2秒前
北堂发布了新的文献求助10
2秒前
2秒前
2秒前
2秒前
背后西装完成签到 ,获得积分10
3秒前
眯眯眼的鞋垫完成签到,获得积分10
3秒前
谨慎念云完成签到 ,获得积分10
3秒前
yuzu完成签到,获得积分10
4秒前
桐桐应助小zz采纳,获得10
4秒前
英姑应助鲤鱼平安采纳,获得10
4秒前
Z_ttkokil完成签到 ,获得积分10
4秒前
feng完成签到,获得积分10
4秒前
天真的若灵完成签到,获得积分10
5秒前
5秒前
6wt完成签到,获得积分10
5秒前
tonstark完成签到,获得积分10
5秒前
潇洒的书文完成签到,获得积分10
5秒前
5秒前
慕青应助霸气的半烟采纳,获得10
6秒前
烟花应助大黑采纳,获得10
6秒前
6秒前
反杀闰土的猹完成签到,获得积分10
6秒前
优雅柏柳发布了新的文献求助10
6秒前
顾矜应助学术学习采纳,获得10
7秒前
赵子迪完成签到,获得积分10
7秒前
打打应助DH采纳,获得10
7秒前
7秒前
Yummy完成签到,获得积分10
8秒前
9秒前
小周长大开飞船完成签到 ,获得积分10
9秒前
17876581310完成签到 ,获得积分10
9秒前
9秒前
HAL9000完成签到,获得积分10
10秒前
方曼容完成签到,获得积分10
10秒前
mayi完成签到,获得积分10
10秒前
儒雅的傲芙完成签到,获得积分10
10秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Aerospace Standards Index - 2026 ASIN2026 3000
Polymorphism and polytypism in crystals 1000
Signals, Systems, and Signal Processing 610
Discrete-Time Signals and Systems 610
Research Methods for Business: A Skill Building Approach, 9th Edition 500
Social Work and Social Welfare: An Invitation(7th Edition) 410
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 纳米技术 有机化学 物理 生物化学 化学工程 计算机科学 复合材料 内科学 催化作用 光电子学 物理化学 电极 冶金 遗传学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 6051687
求助须知:如何正确求助?哪些是违规求助? 7863279
关于积分的说明 16270294
捐赠科研通 5196950
什么是DOI,文献DOI怎么找? 2780823
邀请新用户注册赠送积分活动 1763766
关于科研通互助平台的介绍 1645758