Fleet size planning in crowdsourced delivery: Balancing service level and driver utilization

IF 6.9 2区 管理学 Q1 MANAGEMENT
Aliaa Alnaggar, Sahil Bhatt
{"title":"Fleet size planning in crowdsourced delivery: Balancing service level and driver utilization","authors":"Aliaa Alnaggar,&nbsp;Sahil Bhatt","doi":"10.1016/j.omega.2025.103445","DOIUrl":null,"url":null,"abstract":"<div><div>This paper addresses the fleet size planning problem for crowdsourced delivery platforms, focusing on optimizing the number of crowdsourced drivers to balance the platform’s service level and driver utilization. This is motivated by recent regulatory measures that limit the number of vehicle licenses a platform can hold, which caps fleet size as a means to enhance driver working conditions and mitigate congestion and emissions caused by an excessive number of idle vehicles on the road. We propose a two-stage optimization model where the first stage involves tactical decisions for determining fleet sizes, while the second stage captures the operational dynamics of the platform by a Markov decision process (MDP) in which uncertain crowd driver arrival in the MDP depends on fleet size decisions in the first stage, introducing decision-dependent uncertainty. To efficiently solve the model, we employ a value function approximation (VFA) algorithm that iteratively determines fleet sizes using Boltzmann exploration then approximates the second-stage MDP using a rolling-horizon parametric cost function approximation. Extensive computational experiments confirm the effectiveness of the VFA algorithm, demonstrating its ability to meet both service level and driver utilization targets under various conditions. The results show that a platform can achieve high driver utilization and meet its service level target while only marginally reducing its profit, especially when driver behavior is more predictable and fleet sizes are temporally adjusted.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"139 ","pages":"Article 103445"},"PeriodicalIF":6.9000,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Omega-international Journal of Management Science","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305048325001719","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/10/18 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

Abstract

This paper addresses the fleet size planning problem for crowdsourced delivery platforms, focusing on optimizing the number of crowdsourced drivers to balance the platform’s service level and driver utilization. This is motivated by recent regulatory measures that limit the number of vehicle licenses a platform can hold, which caps fleet size as a means to enhance driver working conditions and mitigate congestion and emissions caused by an excessive number of idle vehicles on the road. We propose a two-stage optimization model where the first stage involves tactical decisions for determining fleet sizes, while the second stage captures the operational dynamics of the platform by a Markov decision process (MDP) in which uncertain crowd driver arrival in the MDP depends on fleet size decisions in the first stage, introducing decision-dependent uncertainty. To efficiently solve the model, we employ a value function approximation (VFA) algorithm that iteratively determines fleet sizes using Boltzmann exploration then approximates the second-stage MDP using a rolling-horizon parametric cost function approximation. Extensive computational experiments confirm the effectiveness of the VFA algorithm, demonstrating its ability to meet both service level and driver utilization targets under various conditions. The results show that a platform can achieve high driver utilization and meet its service level target while only marginally reducing its profit, especially when driver behavior is more predictable and fleet sizes are temporally adjusted.
众包配送中的车队规模规划:平衡服务水平和司机利用率
本文研究众包配送平台的车队规模规划问题,重点优化众包司机数量,平衡平台的服务水平和司机利用率。最近的监管措施限制了一个平台可以持有的车辆牌照数量,这限制了车队规模,以此来改善司机的工作条件,缓解道路上闲置车辆过多造成的拥堵和排放。我们提出了一个两阶段优化模型,其中第一阶段涉及确定车队规模的战术决策,而第二阶段通过马尔可夫决策过程(MDP)捕获平台的运行动态,其中不确定的人群驾驶员到达MDP取决于第一阶段的车队规模决策,引入决策依赖的不确定性。为了有效地求解该模型,我们采用了一种值函数近似(VFA)算法,该算法使用玻尔兹曼探索迭代确定船队规模,然后使用滚动水平参数成本函数近似近似第二阶段MDP。大量的计算实验证实了VFA算法的有效性,证明了该算法能够满足各种条件下的服务水平和驾驶员利用率目标。结果表明,在司机行为可预测性较强、车队规模可临时调整的情况下,平台在实现高司机利用率和服务水平目标的同时,仅能略微降低利润。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Omega-international Journal of Management Science
Omega-international Journal of Management Science 管理科学-运筹学与管理科学
CiteScore
13.80
自引率
11.60%
发文量
130
审稿时长
56 days
期刊介绍: Omega reports on developments in management, including the latest research results and applications. Original contributions and review articles describe the state of the art in specific fields or functions of management, while there are shorter critical assessments of particular management techniques. Other features of the journal are the "Memoranda" section for short communications and "Feedback", a correspondence column. Omega is both stimulating reading and an important source for practising managers, specialists in management services, operational research workers and management scientists, management consultants, academics, students and research personnel throughout the world. The material published is of high quality and relevance, written in a manner which makes it accessible to all of this wide-ranging readership. Preference will be given to papers with implications to the practice of management. Submissions of purely theoretical papers are discouraged. The review of material for publication in the journal reflects this aim.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书