Vehicle Routing with Stochastic Supply of Crowd Vehicles and Time Windows

Fabian Torres, M. Gendreau, W. Rei
{"title":"Vehicle Routing with Stochastic Supply of Crowd Vehicles and Time Windows","authors":"Fabian Torres, M. Gendreau, W. Rei","doi":"10.1287/trsc.2021.1101","DOIUrl":null,"url":null,"abstract":"The growth of e-commerce has increased demand for last-mile deliveries, increasing the level of congestion in the existing transportation infrastructure in urban areas. Crowdsourcing deliveries can provide the additional capacity needed to meet the growing demand in a cost-effective way. We introduce a setting where a crowd-shipping platform sells heterogeneous products of different sizes from a central depot. Items sold vary from groceries to electronics. Some items must be delivered within a time window, whereas others need a customer signature. Furthermore, customer presence is not guaranteed, and some deliveries may need to be returned to the depot. Delivery requests are fulfilled by a fleet of professional drivers and a pool of crowd drivers. We present a crowd-shipping platform that standardizes crowd drivers’ capacities and compensates them to return undelivered packages back to the depot. We formulate a two-stage stochastic model, and we propose a branch and price algorithm to solve the problem exactly and a column generation heuristic to solve larger problems quickly. We further develop an analytical method to calculate upper bounds on the supply of vehicles and an innovative cohesive pricing problem to generate columns for the pool of crowd drivers. Computational experiments are carried out on modified Solomon instances with a pool of 100 crowd vehicles. The branch and price algorithm is able to solve instances of up to 100 customers. We show that the value of the stochastic solution can be as high as 18% when compared with the solution obtained from a deterministic simplification of the model. Significant cost reductions of up to 28% are achieved by implementing crowd drivers with low compensations or higher capacities. Finally, we evaluate what happens when crowd drivers are given the autonomy to select routes based on rational and irrational behavior. There is no cost increase when crowd drivers are rational and select routes that have a higher compensation first. However, when crowd drivers are irrational and select routes randomly, the cost can increase up to 4.2% for some instances.","PeriodicalId":23247,"journal":{"name":"Transp. Sci.","volume":"461 1","pages":"631-653"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transp. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/trsc.2021.1101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

The growth of e-commerce has increased demand for last-mile deliveries, increasing the level of congestion in the existing transportation infrastructure in urban areas. Crowdsourcing deliveries can provide the additional capacity needed to meet the growing demand in a cost-effective way. We introduce a setting where a crowd-shipping platform sells heterogeneous products of different sizes from a central depot. Items sold vary from groceries to electronics. Some items must be delivered within a time window, whereas others need a customer signature. Furthermore, customer presence is not guaranteed, and some deliveries may need to be returned to the depot. Delivery requests are fulfilled by a fleet of professional drivers and a pool of crowd drivers. We present a crowd-shipping platform that standardizes crowd drivers’ capacities and compensates them to return undelivered packages back to the depot. We formulate a two-stage stochastic model, and we propose a branch and price algorithm to solve the problem exactly and a column generation heuristic to solve larger problems quickly. We further develop an analytical method to calculate upper bounds on the supply of vehicles and an innovative cohesive pricing problem to generate columns for the pool of crowd drivers. Computational experiments are carried out on modified Solomon instances with a pool of 100 crowd vehicles. The branch and price algorithm is able to solve instances of up to 100 customers. We show that the value of the stochastic solution can be as high as 18% when compared with the solution obtained from a deterministic simplification of the model. Significant cost reductions of up to 28% are achieved by implementing crowd drivers with low compensations or higher capacities. Finally, we evaluate what happens when crowd drivers are given the autonomy to select routes based on rational and irrational behavior. There is no cost increase when crowd drivers are rational and select routes that have a higher compensation first. However, when crowd drivers are irrational and select routes randomly, the cost can increase up to 4.2% for some instances.
随机供给人群车辆和时间窗下的车辆路径
电子商务的发展增加了对最后一英里配送的需求,增加了城市地区现有交通基础设施的拥堵程度。众包交付可以提供所需的额外能力,以符合成本效益的方式满足日益增长的需求。我们引入了一个场景,在这个场景中,一个众筹平台从一个中心仓库销售不同大小的异质产品。出售的商品从杂货到电子产品都有。有些项目必须在一个时间窗口内交付,而其他项目则需要客户签名。此外,不能保证客户的存在,并且一些交付可能需要返回仓库。送货要求由一队专业司机和一群群众司机来完成。我们提出了一个人群配送平台,标准化人群司机的能力,并补偿他们将未投递的包裹退回到仓库。我们建立了一个两阶段的随机模型,并提出了一个分支和价格算法来精确地解决问题,提出了一个列生成启发式算法来快速解决更大的问题。我们进一步开发了一种分析方法来计算车辆供应的上限,并提出了一个创新的内聚定价问题来生成人群驾驶员池的列。在100辆人群车辆池中对改进的Solomon实例进行了计算实验。分支和价格算法能够解决多达100个客户的实例。我们表明,与从模型的确定性简化中获得的解相比,随机解的值可以高达18%。通过实施低补偿或更高容量的人群驱动程序,可显著降低高达28%的成本。最后,我们评估了当人群驾驶员被赋予基于理性和非理性行为的自主选择路线时会发生什么。当人群驾驶员是理性的,优先选择补偿较高的路线时,成本不会增加。然而,当人群司机不理性,随机选择路线时,某些情况下成本可能会增加4.2%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信