Efficiency with consent: Permutable queueing in on-demand services

IF 7.2 2区 管理学 Q1 MANAGEMENT
Tianyu Wang , Desheng Wu , Jiaxian Yang
{"title":"Efficiency with consent: Permutable queueing in on-demand services","authors":"Tianyu Wang ,&nbsp;Desheng Wu ,&nbsp;Jiaxian Yang","doi":"10.1016/j.omega.2025.103361","DOIUrl":null,"url":null,"abstract":"<div><div>In the context of ride-hailing, efficiency and fairness are at times competing objectives. Ride-hailing service providers use batch matching during non-rush hours and switch to queueing mode during rush hours. Batch matching achieves higher efficiency regardless of when orders are submitted, while in the queueing mode, orders are fulfilled on a first-come, first-served basis at a given pick-up location. This study proposes a permutable queueing mode to improve efficiency under fairness in ride-hailing services during rush hour. In the proposed mode, the sequence of serving orders can be permuted based on customers’ behavior. The mechanism is modeled using a Markov Decision Process and solved by Deep Q-Network with space reduction techniques. Moreover, as a sub-problem of the proposed mode, the study examines the Dial-A-Ride problem in the conventional queueing mode by proposing a polynomial exact algorithm, an asymptotic algorithm, and a heuristic algorithm. Through simulation experiments using real-world data, we observed that queue permutation outperformed the conventional mode in terms of both profitability and customer experience. Managerial insights are derived that virtual queueing does more harm than good, as it does not enhance profits while misleading users during extended waiting periods.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"138 ","pages":"Article 103361"},"PeriodicalIF":7.2000,"publicationDate":"2025-06-11","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/S0305048325000878","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

Abstract

In the context of ride-hailing, efficiency and fairness are at times competing objectives. Ride-hailing service providers use batch matching during non-rush hours and switch to queueing mode during rush hours. Batch matching achieves higher efficiency regardless of when orders are submitted, while in the queueing mode, orders are fulfilled on a first-come, first-served basis at a given pick-up location. This study proposes a permutable queueing mode to improve efficiency under fairness in ride-hailing services during rush hour. In the proposed mode, the sequence of serving orders can be permuted based on customers’ behavior. The mechanism is modeled using a Markov Decision Process and solved by Deep Q-Network with space reduction techniques. Moreover, as a sub-problem of the proposed mode, the study examines the Dial-A-Ride problem in the conventional queueing mode by proposing a polynomial exact algorithm, an asymptotic algorithm, and a heuristic algorithm. Through simulation experiments using real-world data, we observed that queue permutation outperformed the conventional mode in terms of both profitability and customer experience. Managerial insights are derived that virtual queueing does more harm than good, as it does not enhance profits while misleading users during extended waiting periods.
具有同意的效率:按需服务中的可变队列
在网约车的背景下,效率和公平有时是相互竞争的目标。网约车服务提供商在非高峰时段使用批量匹配,在高峰时段切换到排队模式。批量匹配无论何时提交订单都可以实现更高的效率,而在排队模式下,订单在给定的取货位置按先到先得的原则完成。为了提高高峰时段网约车服务在公平条件下的效率,提出了一种可变排队模式。在提出的模式中,服务顺序可以根据顾客的行为进行排列。该机制采用马尔可夫决策过程建模,并采用深度q -网络与空间约简技术求解。此外,作为该模式的子问题,本文通过提出多项式精确算法、渐近算法和启发式算法来研究传统排队模式下的Dial-A-Ride问题。通过使用真实世界数据的模拟实验,我们观察到队列排列在盈利能力和客户体验方面都优于传统模式。管理层的见解是,虚拟排队弊大于利,因为它不会增加利润,反而会在长时间的等待中误导用户。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信