Consistent routing for local same-day delivery via micro-hubs

Author:

Ackva CharlotteORCID,Ulmer Marlin W.

Abstract

AbstractAn increasing number of local shops offer same-day delivery in order to compete with the online giants. However, the distribution of parcels from individual shops to customers reduces the rare consolidation opportunities in the last mile even further. Thus, shops start collaborating on urban same-day delivery by using shared vehicles and micro-depots for consolidated transportation of parcels. At this, many stakeholders (storekeepers, drivers, and customers) need to be coordinated. Consistent routes between micro-hubs simplify the distribution process and increase reliability for all stakeholders involved. The shared vehicles thus conduct consistent daily routes between micro-hubs in the city, serving as transshipment and consolidation centres. This allows stores to bring orders to the next micro-hub, where the parcel is picked up by a vehicle and delivered to the micro-hub closest to its destination—if it is feasible with respect to the vehicle’s consistent daily schedule. Creating effective schedules is therefore very important. The difficulty of finding an effective consistent route is amplified by the daily uncertainty in order placements. We model the problem as a two-stage stochastic program. While the first stage determines the vehicle schedules, the second stage optimises the flow of realised orders. The goal is to satisfy as many orders per day as possible with the shared vehicles. We propose a time-expanded network formulation of the problem which is solved to optimality using commercial MIP-software. We assess our model against a non-consistent upper bound and a practically-inspired heuristic to evaluate the cost of consistency and the consolidation of goods. We analyse the performance of our method for a variety of instance settings. We observe that collaborative delivery via micro-hubs is worthwhile for delivery time promises of two hours or more. Noticeably, for these service promises, the costs of consistency are surprisingly low.

Funder

Deutsche Forschungsgemeinschaft

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,Business, Management and Accounting (miscellaneous)

Reference46 articles.

1. Angelelli E, Archetti C, Filippi C, Vindigni M (2017) The probabilistic orienteering problem. Comput Oper Res 81:269–281

2. Bernardo M, Pannek J (2018) Robust solution approach for the dynamic and stochastic vehicle routing problem. J Adv Transp 2018:1–11

3. Bertsimas DJ, Jaillet P, Odoni AR (1990) A priori optimization. Oper Res 38(6):1019–1033

4. Bundesverband Paket und Expresslogistik e.V. (BIEK) (2021) KE-CONSULT Kurte & Esser GbR: Möglichmacher in bewegten Zeiten, KEP-Studie 2021—Analyse des Marktes in Deutschland. https://www.biek.de/publikationen/studien.html. Accessed 25 Feb 2022

5. Burns T, Davis A, Harris T, Kuzmanovic A (2022) Beyond the distribution center. https://www.mckinsey.com/industries/retail/our-insights/beyond-the-distribution-center. Accessed 24 June 2022

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Online flash delivery from multiple depots;Transportation Letters;2023-11-18

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3