已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人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
2秒前
2秒前
puhong zhang发布了新的文献求助20
4秒前
tjnksy完成签到,获得积分10
6秒前
7秒前
7秒前
黄思月发布了新的文献求助10
7秒前
77完成签到 ,获得积分10
8秒前
10秒前
aaa5a123完成签到 ,获得积分10
10秒前
lxl发布了新的文献求助10
12秒前
viviat发布了新的文献求助10
14秒前
Gates发布了新的文献求助10
14秒前
尘染完成签到 ,获得积分10
15秒前
18秒前
18秒前
丘比特应助Gates采纳,获得10
18秒前
英俊的小懒虫完成签到 ,获得积分10
19秒前
RYYYYYYY233完成签到 ,获得积分10
19秒前
21秒前
爆米花应助科研通管家采纳,获得30
23秒前
在水一方应助科研通管家采纳,获得10
23秒前
星辰大海应助科研通管家采纳,获得10
23秒前
23秒前
puhong zhang发布了新的文献求助10
23秒前
上官若男应助科研通管家采纳,获得10
23秒前
25秒前
ColinWine发布了新的文献求助10
25秒前
25秒前
blueskyzhi完成签到,获得积分10
26秒前
彭于晏应助玉米侠采纳,获得10
26秒前
27秒前
一个苹果发布了新的文献求助10
29秒前
Overlap完成签到 ,获得积分10
30秒前
31秒前
lxl完成签到,获得积分10
31秒前
研时友发布了新的文献求助10
32秒前
Ahui完成签到 ,获得积分10
33秒前
隐形曼青应助Yang采纳,获得10
34秒前
ColinWine完成签到,获得积分10
34秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Kinesiophobia : a new view of chronic pain behavior 2000
Burger's Medicinal Chemistry, Drug Discovery and Development, Volumes 1 - 8, 8 Volume Set, 8th Edition 1800
Cronologia da história de Macau 1600
文献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
Lloyd's Register of Shipping's Approach to the Control of Incidents of Brittle Fracture in Ship Structures 1000
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 纳米技术 计算机科学 化学工程 生物化学 物理 复合材料 内科学 催化作用 物理化学 光电子学 细胞生物学 基因 电极 遗传学
热门帖子
关注 科研通微信公众号,转发送积分 6150298
求助须知:如何正确求助?哪些是违规求助? 7978972
关于积分的说明 16574827
捐赠科研通 5262503
什么是DOI,文献DOI怎么找? 2808625
邀请新用户注册赠送积分活动 1788845
关于科研通互助平台的介绍 1656916