送餐服务的能力要求和需求管理策略

IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Ramon Auad , Alan Erera , Martin Savelsbergh
{"title":"送餐服务的能力要求和需求管理策略","authors":"Ramon Auad ,&nbsp;Alan Erera ,&nbsp;Martin Savelsbergh","doi":"10.1016/j.ejtl.2024.100135","DOIUrl":null,"url":null,"abstract":"<div><p>Online restaurant aggregators, which connect diners with restaurants and organize the delivery of ordered meals, have experienced significant growth in recent years. Meal delivery logistics is quite challenging, primarily due to the difficulty in managing the supply of delivery resources, i.e., crowdsourced couriers, to satisfy dynamic and uncertain customer demand under very tight time constraints. In this paper, we study several questions in meal delivery operations focused on matching the correct levels of supply with demand. To ensure excellent customer service, delivery aggregators may, for example, decide to temporarily decrease demand during an operating day by temporarily reducing the delivery area for one or more restaurants. We show that such simple demand restriction strategies allow a significantly smaller fleet to meet service requirements. To simplify analysis, we focus on problem geometries that enable the use of stylized mixed integer programs to optimally deploy a fleet of couriers serving large numbers of orders. Applying the proposed framework to several scenarios with one and two depots, we conduct an extensive experimental study of the effects on system performance of (i) allowing courier sharing between multiple depots, (ii) relaxing the delivery deadlines of placed orders, and (iii) restricting demand through limited adjustment of the coverage of restaurants. The results demonstrate the potential effectiveness of different dispatch control and demand management mechanisms, in terms of both the required courier fleet size to serve requests and the coverage level of orders.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000104/pdfft?md5=7b42af90e36c255bf6d3147a2b169514&pid=1-s2.0-S2192437624000104-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Capacity requirements and demand management strategies in meal delivery\",\"authors\":\"Ramon Auad ,&nbsp;Alan Erera ,&nbsp;Martin Savelsbergh\",\"doi\":\"10.1016/j.ejtl.2024.100135\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Online restaurant aggregators, which connect diners with restaurants and organize the delivery of ordered meals, have experienced significant growth in recent years. Meal delivery logistics is quite challenging, primarily due to the difficulty in managing the supply of delivery resources, i.e., crowdsourced couriers, to satisfy dynamic and uncertain customer demand under very tight time constraints. In this paper, we study several questions in meal delivery operations focused on matching the correct levels of supply with demand. To ensure excellent customer service, delivery aggregators may, for example, decide to temporarily decrease demand during an operating day by temporarily reducing the delivery area for one or more restaurants. We show that such simple demand restriction strategies allow a significantly smaller fleet to meet service requirements. To simplify analysis, we focus on problem geometries that enable the use of stylized mixed integer programs to optimally deploy a fleet of couriers serving large numbers of orders. Applying the proposed framework to several scenarios with one and two depots, we conduct an extensive experimental study of the effects on system performance of (i) allowing courier sharing between multiple depots, (ii) relaxing the delivery deadlines of placed orders, and (iii) restricting demand through limited adjustment of the coverage of restaurants. The results demonstrate the potential effectiveness of different dispatch control and demand management mechanisms, in terms of both the required courier fleet size to serve requests and the coverage level of orders.</p></div>\",\"PeriodicalId\":45871,\"journal\":{\"name\":\"EURO Journal on Transportation and Logistics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2024-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2192437624000104/pdfft?md5=7b42af90e36c255bf6d3147a2b169514&pid=1-s2.0-S2192437624000104-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EURO Journal on Transportation and Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2192437624000104\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Transportation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192437624000104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

摘要

连接食客与餐厅并组织送餐的在线餐厅聚合商近年来经历了大幅增长。送餐物流具有相当大的挑战性,这主要是由于很难管理送餐资源(即众包快递员)的供应,以在非常紧迫的时间限制下满足动态和不确定的客户需求。在本文中,我们研究了送餐业务中的几个问题,重点是如何正确匹配供需水平。例如,为了确保优质的客户服务,送餐聚合商可能会决定在一个工作日内通过暂时减少一家或多家餐厅的送餐区域来暂时降低需求。我们的研究表明,这种简单的需求限制策略可以使车队的规模大大缩小,从而满足服务要求。为了简化分析,我们将重点放在问题几何图形上,以便使用风格化的混合整数程序来优化部署为大量订单提供服务的快递员队伍。我们将提出的框架应用于有一个和两个仓库的几种情况,并对以下情况对系统性能的影响进行了广泛的实验研究:(i) 允许多个仓库共享快递员;(ii) 放宽订单的交付期限;(iii) 通过对餐厅覆盖范围的有限调整来限制需求。研究结果表明,不同的调度控制和需求管理机制在满足需求所需的快递队伍规模和订单覆盖水平方面都具有潜在的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Capacity requirements and demand management strategies in meal delivery

Online restaurant aggregators, which connect diners with restaurants and organize the delivery of ordered meals, have experienced significant growth in recent years. Meal delivery logistics is quite challenging, primarily due to the difficulty in managing the supply of delivery resources, i.e., crowdsourced couriers, to satisfy dynamic and uncertain customer demand under very tight time constraints. In this paper, we study several questions in meal delivery operations focused on matching the correct levels of supply with demand. To ensure excellent customer service, delivery aggregators may, for example, decide to temporarily decrease demand during an operating day by temporarily reducing the delivery area for one or more restaurants. We show that such simple demand restriction strategies allow a significantly smaller fleet to meet service requirements. To simplify analysis, we focus on problem geometries that enable the use of stylized mixed integer programs to optimally deploy a fleet of couriers serving large numbers of orders. Applying the proposed framework to several scenarios with one and two depots, we conduct an extensive experimental study of the effects on system performance of (i) allowing courier sharing between multiple depots, (ii) relaxing the delivery deadlines of placed orders, and (iii) restricting demand through limited adjustment of the coverage of restaurants. The results demonstrate the potential effectiveness of different dispatch control and demand management mechanisms, in terms of both the required courier fleet size to serve requests and the coverage level of orders.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
×
引用
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学术官方微信