Price-aware real-time ride-sharing at scale: an auction-based approach

M. Asghari, Dingxiong Deng, C. Shahabi, Ugur Demiryurek, Yaguang Li
{"title":"Price-aware real-time ride-sharing at scale: an auction-based approach","authors":"M. Asghari, Dingxiong Deng, C. Shahabi, Ugur Demiryurek, Yaguang Li","doi":"10.1145/2996913.2996974","DOIUrl":null,"url":null,"abstract":"Real-time ride-sharing, which enables on-the-fly matching between riders and drivers (even en-route), is an important problem due to its environmental and societal benefits. With the emergence of many ride-sharing platforms (e.g., Uber and Lyft), the design of a scalable framework to match riders and drivers based on their various constraints while maximizing the overall profit of the platform becomes a distinguishing business strategy. A key challenge of such framework is to satisfy both types of the users in the system, e.g., reducing both riders' and drivers' travel distances. However, the majority of the existing approaches focus only on minimizing the total travel distance of drivers which is not always equivalent to shorter trips for riders. Hence, we propose a fair pricing model that simultaneously satisfies both the riders' and drivers' constraints and desires (formulated as their profiles). In particular, we introduce a distributed auction-based framework where each driver's mobile app automatically bids on every nearby request taking into account many factors such as both the driver's and the riders' profiles, their itineraries, the pricing model, and the current number of riders in the vehicle. Subsequently, the server determines the highest bidder and assigns the rider to that driver. We show that this framework is scalable and efficient, processing hundreds of tasks per second in the presence of thousands of drivers. We compare our framework with the state-of-the-art approaches in both industry and academia through experiments on New York City's taxi dataset. Our results show that our framework can simultaneously match more riders to drivers (i.e., higher service rate) by engaging the drivers more effectively. Moreover, our frame-work schedules shorter trips for riders (i.e., better service quality). Finally, as a consequence of higher service rate and shorter trips, our framework increases the overall profit of the ride-sharing platforms.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"100","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2996913.2996974","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 100

Abstract

Real-time ride-sharing, which enables on-the-fly matching between riders and drivers (even en-route), is an important problem due to its environmental and societal benefits. With the emergence of many ride-sharing platforms (e.g., Uber and Lyft), the design of a scalable framework to match riders and drivers based on their various constraints while maximizing the overall profit of the platform becomes a distinguishing business strategy. A key challenge of such framework is to satisfy both types of the users in the system, e.g., reducing both riders' and drivers' travel distances. However, the majority of the existing approaches focus only on minimizing the total travel distance of drivers which is not always equivalent to shorter trips for riders. Hence, we propose a fair pricing model that simultaneously satisfies both the riders' and drivers' constraints and desires (formulated as their profiles). In particular, we introduce a distributed auction-based framework where each driver's mobile app automatically bids on every nearby request taking into account many factors such as both the driver's and the riders' profiles, their itineraries, the pricing model, and the current number of riders in the vehicle. Subsequently, the server determines the highest bidder and assigns the rider to that driver. We show that this framework is scalable and efficient, processing hundreds of tasks per second in the presence of thousands of drivers. We compare our framework with the state-of-the-art approaches in both industry and academia through experiments on New York City's taxi dataset. Our results show that our framework can simultaneously match more riders to drivers (i.e., higher service rate) by engaging the drivers more effectively. Moreover, our frame-work schedules shorter trips for riders (i.e., better service quality). Finally, as a consequence of higher service rate and shorter trips, our framework increases the overall profit of the ride-sharing platforms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
价格敏感的大规模实时拼车:一种基于拍卖的方法
由于其环境和社会效益,实时乘车共享是一个重要的问题,它可以实现乘客和司机之间的即时匹配(甚至在途中)。随着许多拼车平台(如Uber和Lyft)的出现,设计一个可扩展的框架来匹配乘客和司机的各种约束,同时最大化平台的整体利润成为一种独特的商业策略。这种框架的一个关键挑战是满足系统中两种类型的用户,例如,减少乘客和司机的旅行距离。然而,现有的大多数方法只关注最小化驾驶员的总行程距离,这并不总是等同于缩短乘客的行程。因此,我们提出了一个公平的定价模型,同时满足乘客和司机的约束和愿望(表述为他们的个人资料)。特别是,我们引入了一个基于分布式拍卖的框架,每个司机的移动应用程序自动对每个附近的请求进行出价,考虑到许多因素,如司机和乘客的个人资料,他们的行程,定价模型,以及当前车辆中的乘客数量。随后,服务器确定出价最高的竞标者,并将骑手分配给该驾驶员。我们证明了这个框架是可扩展的和高效的,在数千个驱动程序存在的情况下每秒处理数百个任务。我们通过对纽约市出租车数据集的实验,将我们的框架与工业界和学术界最先进的方法进行了比较。我们的研究结果表明,通过更有效地吸引司机,我们的框架可以同时匹配更多的乘客和司机(即更高的服务率)。此外,我们的框架为乘客安排了更短的行程(即更好的服务质量)。最后,由于更高的服务率和更短的行程,我们的框架增加了拼车平台的整体利润。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Location corroborations by mobile devices without traces Knowledge-based trajectory completion from sparse GPS samples Particle filter for real-time human mobility prediction following unprecedented disaster Pyspatiotemporalgeom: a python library for spatiotemporal types and operations Fast transportation network traversal with hyperedges: (industrial paper)
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1