Deep reinforcement learning for stochastic last-mile delivery with crowdshipping

IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE EURO Journal on Transportation and Logistics Pub Date : 2023-01-01 DOI:10.1016/j.ejtl.2023.100105
Marco Silva , João Pedro Pedroso , Ana Viana
{"title":"Deep reinforcement learning for stochastic last-mile delivery with crowdshipping","authors":"Marco Silva ,&nbsp;João Pedro Pedroso ,&nbsp;Ana Viana","doi":"10.1016/j.ejtl.2023.100105","DOIUrl":null,"url":null,"abstract":"<div><p>We study a setting in which a company not only has a fleet of capacitated vehicles and drivers available to make deliveries but may also use the services of occasional drivers (ODs) willing to make deliveries using their own vehicles in return for a small fee. Under such a business model, a.k.a crowdshipping, the company seeks to make all the deliveries at the minimum total cost, i.e., the cost associated with their vehicles plus the compensation paid to the ODs.</p><p>We consider a stochastic and dynamic last-mile delivery environment in which customer delivery orders, as well as ODs available for deliveries, arrive randomly throughout the day, within fixed time windows.</p><p>We present a novel deep reinforcement learning (DRL) approach to the problem that can deal with large problem instances. We formulate the action selection problem as a mixed-integer optimization program.</p><p>The DRL approach is compared against other optimization under uncertainty approaches, namely, sample-average approximation (SAA) and distributionally robust optimization (DRO). The results show the effectiveness of the DRL approach by examining out-of-sample performance.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Transportation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S219243762300002X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 1

Abstract

We study a setting in which a company not only has a fleet of capacitated vehicles and drivers available to make deliveries but may also use the services of occasional drivers (ODs) willing to make deliveries using their own vehicles in return for a small fee. Under such a business model, a.k.a crowdshipping, the company seeks to make all the deliveries at the minimum total cost, i.e., the cost associated with their vehicles plus the compensation paid to the ODs.

We consider a stochastic and dynamic last-mile delivery environment in which customer delivery orders, as well as ODs available for deliveries, arrive randomly throughout the day, within fixed time windows.

We present a novel deep reinforcement learning (DRL) approach to the problem that can deal with large problem instances. We formulate the action selection problem as a mixed-integer optimization program.

The DRL approach is compared against other optimization under uncertainty approaches, namely, sample-average approximation (SAA) and distributionally robust optimization (DRO). The results show the effectiveness of the DRL approach by examining out-of-sample performance.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
众包随机最后一英里配送的深度强化学习
我们研究了这样一种情况,在这种情况下,一家公司不仅拥有一组可用于送货的车辆和司机,而且还可能使用愿意使用自己的车辆送货的临时司机(ODs)的服务,以换取少量费用。在这种商业模式下,即众包,该公司寻求以最低的总成本完成所有的交付,即与他们的车辆相关的成本加上支付给od的补偿。我们考虑一个随机和动态的最后一英里交付环境,在这个环境中,客户交付订单以及可用的odd在固定的时间窗口内随机到达。我们提出了一种新的深度强化学习(DRL)方法,可以处理大型问题实例。我们将行动选择问题表述为一个混合整数优化方案。将DRL方法与其他不确定性优化方法,即样本平均近似(SAA)和分布鲁棒优化(DRO)进行了比较。通过对样本外性能的检验,验证了DRL方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
4.60
自引率
0.00%
发文量
24
审稿时长
129 days
期刊介绍: The EURO Journal on Transportation and Logistics promotes the use of mathematics in general, and operations research in particular, in the context of transportation and logistics. It is a forum for the presentation of original mathematical models, methodologies and computational results, focussing on advanced applications in transportation and logistics. The journal publishes two types of document: (i) research articles and (ii) tutorials. A research article presents original methodological contributions to the field (e.g. new mathematical models, new algorithms, new simulation techniques). A tutorial provides an introduction to an advanced topic, designed to ease the use of the relevant methodology by researchers and practitioners.
期刊最新文献
Inbound traffic capture link-design problem independent of assumptions on users’ route choices Modeling and solving a corporate vehicle-sharing problem combined with other modes of transport A fair multi-commodity two-echelon distribution problem Price optimal routing in public transportation Inbound traffic capture link-design problem independent of assumptions on users’ route choices
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1