自由职业司机的衰退选择:优化按需移动服务的调度菜单

IF 5.8 1区 工程技术 Q1 ECONOMICS
Yue Yang , Seeun William Umboh , Mohsen Ramezani
{"title":"自由职业司机的衰退选择:优化按需移动服务的调度菜单","authors":"Yue Yang ,&nbsp;Seeun William Umboh ,&nbsp;Mohsen Ramezani","doi":"10.1016/j.trb.2024.103082","DOIUrl":null,"url":null,"abstract":"<div><div>With the prosperity of sharing economy, more part-time and freelance suppliers (i.e., drivers) join on-demand mobility services. Because of suppliers’ autonomy and behavioural heterogeneity, the platform cannot ensure that suppliers will accept a dispatch order. One approach to mitigate this supply uncertainty is to provide suppliers with personalized menus of dispatch recommendations. A key issue then is to determine which dispatch orders (that can be passenger or goods services) should be allocated into the assortment menu of each supplier. This paper probabilistically models the suppliers’ order acceptance and choice behaviour, including a <em>decline</em> option. We propose two assortment optimization problems, disjoint and joint menus, to maximize the expected number of matches. We show that the objective function of the disjoint menu assortment problem is monotone non-decreasing submodular. In contrast, the objective function of the joint menu assortment problem is non-monotone and non-submodular. Accordingly, we present a standard greedy (SG) algorithm to solve the disjoint assortment problem, and <span><math><msup><mrow><mi>γ</mi></mrow><mrow><mo>∗</mo></mrow></msup></math></span>-greedy and local search (LS) algorithms for the joint assortment problem. By bundling orders into consolidated routes, this paper extends the proposed menu assortment methods to the context of meal delivery services. A case study is presented based on the real-world demand in the Manhattan road network. The results show that drivers’ autonomy to decline the dispatch orders creates substantial coexistence of idle drivers and unmatched orders in the market. The proposed menu assortment methods curb such matching friction. Moreover, the numerical results demonstrate that the proposed algorithms significantly outperform the traditional dispatching policies applied in practice, e.g., one-to-one matching, in terms of platform efficiency, e.g., achieving more matches, customers’ experiences, e.g., reducing waiting time, and benefits for drivers, e.g., tapering off the income inequality among drivers.</div></div>","PeriodicalId":54418,"journal":{"name":"Transportation Research Part B-Methodological","volume":"190 ","pages":"Article 103082"},"PeriodicalIF":5.8000,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Freelance drivers with a decline choice: Dispatch menus in on-demand mobility services for assortment optimization\",\"authors\":\"Yue Yang ,&nbsp;Seeun William Umboh ,&nbsp;Mohsen Ramezani\",\"doi\":\"10.1016/j.trb.2024.103082\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>With the prosperity of sharing economy, more part-time and freelance suppliers (i.e., drivers) join on-demand mobility services. Because of suppliers’ autonomy and behavioural heterogeneity, the platform cannot ensure that suppliers will accept a dispatch order. One approach to mitigate this supply uncertainty is to provide suppliers with personalized menus of dispatch recommendations. A key issue then is to determine which dispatch orders (that can be passenger or goods services) should be allocated into the assortment menu of each supplier. This paper probabilistically models the suppliers’ order acceptance and choice behaviour, including a <em>decline</em> option. We propose two assortment optimization problems, disjoint and joint menus, to maximize the expected number of matches. We show that the objective function of the disjoint menu assortment problem is monotone non-decreasing submodular. In contrast, the objective function of the joint menu assortment problem is non-monotone and non-submodular. Accordingly, we present a standard greedy (SG) algorithm to solve the disjoint assortment problem, and <span><math><msup><mrow><mi>γ</mi></mrow><mrow><mo>∗</mo></mrow></msup></math></span>-greedy and local search (LS) algorithms for the joint assortment problem. By bundling orders into consolidated routes, this paper extends the proposed menu assortment methods to the context of meal delivery services. A case study is presented based on the real-world demand in the Manhattan road network. The results show that drivers’ autonomy to decline the dispatch orders creates substantial coexistence of idle drivers and unmatched orders in the market. The proposed menu assortment methods curb such matching friction. Moreover, the numerical results demonstrate that the proposed algorithms significantly outperform the traditional dispatching policies applied in practice, e.g., one-to-one matching, in terms of platform efficiency, e.g., achieving more matches, customers’ experiences, e.g., reducing waiting time, and benefits for drivers, e.g., tapering off the income inequality among drivers.</div></div>\",\"PeriodicalId\":54418,\"journal\":{\"name\":\"Transportation Research Part B-Methodological\",\"volume\":\"190 \",\"pages\":\"Article 103082\"},\"PeriodicalIF\":5.8000,\"publicationDate\":\"2024-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part B-Methodological\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0191261524002066\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part B-Methodological","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0191261524002066","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

随着共享经济的繁荣,越来越多的兼职和自由供应商(即司机)加入按需移动服务。由于供应商的自主性和行为异质性,平台无法确保供应商一定会接受派单。缓解供应不确定性的一种方法是向供应商提供个性化的派遣建议菜单。因此,一个关键问题是确定哪些调度订单(可以是乘客或货物服务)应分配给每个供应商的分类菜单。本文对供应商的订单接受和选择行为(包括拒绝选项)进行了概率建模。我们提出了两个分类优化问题,即不相邻菜单和联合菜单,以最大化预期匹配数量。我们证明,不相邻菜单组合问题的目标函数是单调非递减亚模态的。相反,联合菜单组合问题的目标函数是非单调和非次模态的。因此,我们提出了一种标准贪婪(SG)算法来解决不连贯分类问题,并提出了γ∗-贪婪和局部搜索(LS)算法来解决联合分类问题。通过将订单捆绑到合并路线中,本文将提出的菜单分类方法扩展到送餐服务中。本文基于曼哈顿路网的实际需求进行了案例研究。研究结果表明,由于司机有拒绝派单的自主权,市场上出现了大量闲置司机和未匹配订单并存的情况。所提出的菜单分类方法可以抑制这种匹配摩擦。此外,数值结果表明,建议的算法在平台效率(如实现更多匹配)、客户体验(如减少等待时间)和司机收益(如减少司机之间的收入不平等)等方面都明显优于实际应用的传统调度策略(如一对一匹配)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Freelance drivers with a decline choice: Dispatch menus in on-demand mobility services for assortment optimization
With the prosperity of sharing economy, more part-time and freelance suppliers (i.e., drivers) join on-demand mobility services. Because of suppliers’ autonomy and behavioural heterogeneity, the platform cannot ensure that suppliers will accept a dispatch order. One approach to mitigate this supply uncertainty is to provide suppliers with personalized menus of dispatch recommendations. A key issue then is to determine which dispatch orders (that can be passenger or goods services) should be allocated into the assortment menu of each supplier. This paper probabilistically models the suppliers’ order acceptance and choice behaviour, including a decline option. We propose two assortment optimization problems, disjoint and joint menus, to maximize the expected number of matches. We show that the objective function of the disjoint menu assortment problem is monotone non-decreasing submodular. In contrast, the objective function of the joint menu assortment problem is non-monotone and non-submodular. Accordingly, we present a standard greedy (SG) algorithm to solve the disjoint assortment problem, and γ-greedy and local search (LS) algorithms for the joint assortment problem. By bundling orders into consolidated routes, this paper extends the proposed menu assortment methods to the context of meal delivery services. A case study is presented based on the real-world demand in the Manhattan road network. The results show that drivers’ autonomy to decline the dispatch orders creates substantial coexistence of idle drivers and unmatched orders in the market. The proposed menu assortment methods curb such matching friction. Moreover, the numerical results demonstrate that the proposed algorithms significantly outperform the traditional dispatching policies applied in practice, e.g., one-to-one matching, in terms of platform efficiency, e.g., achieving more matches, customers’ experiences, e.g., reducing waiting time, and benefits for drivers, e.g., tapering off the income inequality among drivers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Transportation Research Part B-Methodological
Transportation Research Part B-Methodological 工程技术-工程:土木
CiteScore
12.40
自引率
8.80%
发文量
143
审稿时长
14.1 weeks
期刊介绍: Transportation Research: Part B publishes papers on all methodological aspects of the subject, particularly those that require mathematical analysis. The general theme of the journal is the development and solution of problems that are adequately motivated to deal with important aspects of the design and/or analysis of transportation systems. Areas covered include: traffic flow; design and analysis of transportation networks; control and scheduling; optimization; queuing theory; logistics; supply chains; development and application of statistical, econometric and mathematical models to address transportation problems; cost models; pricing and/or investment; traveler or shipper behavior; cost-benefit methodologies.
×
引用
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学术官方微信