Real-Time Distributed Taxi Ride Sharing

Kanika Bathla, V. Raychoudhury, Divya Saxena, A. Kshemkalyani
{"title":"Real-Time Distributed Taxi Ride Sharing","authors":"Kanika Bathla, V. Raychoudhury, Divya Saxena, A. Kshemkalyani","doi":"10.1109/ITSC.2018.8569315","DOIUrl":null,"url":null,"abstract":"Taxicabs play an important role in urban public transportation. Analyzing taxi traffic of Shanghai, San Francisco, and New York City, we have found that the short trips within city are mostly of commuters during office hours and span a specific city area. Now, if the large number of commuters are ready to share their rides, that will have a huge impact on the ‘super-commute’ problem faced in various cities of USA and around the world. While ride-sharing can increase taxi occupancy and profit for drivers and savings for passengers, it reduces the overall on-road traffic and thereby the average commute time and carbon foot-print. While centralized ride-sharing services, like car-pooling, can address the problem to some extent, they lack scalability and power to dynamically adapt the taxi schedule for best results. In this paper, we propose a four-way model for the ride-sharing problem and develop a novel distributed taxi ride sharing (TRS) algorithm to address dynamic scheduling of ride sharing requests. Our algorithm shows the overall reduction in total distance travelled by taxis as a result of ride sharing. Empirical results using large scale taxi GPS traces from Shanghai, China show that TRS algorithm can grossly outperform a Taxi Distance Minimization (TDM) algorithm. TRS accommodates 33% higher ride share among passengers while dealing with 44,241 requests handled by 4,000 taxis on a single day in Shanghai.","PeriodicalId":395239,"journal":{"name":"2018 21st International Conference on Intelligent Transportation Systems (ITSC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 21st International Conference on Intelligent Transportation Systems (ITSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2018.8569315","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

Taxicabs play an important role in urban public transportation. Analyzing taxi traffic of Shanghai, San Francisco, and New York City, we have found that the short trips within city are mostly of commuters during office hours and span a specific city area. Now, if the large number of commuters are ready to share their rides, that will have a huge impact on the ‘super-commute’ problem faced in various cities of USA and around the world. While ride-sharing can increase taxi occupancy and profit for drivers and savings for passengers, it reduces the overall on-road traffic and thereby the average commute time and carbon foot-print. While centralized ride-sharing services, like car-pooling, can address the problem to some extent, they lack scalability and power to dynamically adapt the taxi schedule for best results. In this paper, we propose a four-way model for the ride-sharing problem and develop a novel distributed taxi ride sharing (TRS) algorithm to address dynamic scheduling of ride sharing requests. Our algorithm shows the overall reduction in total distance travelled by taxis as a result of ride sharing. Empirical results using large scale taxi GPS traces from Shanghai, China show that TRS algorithm can grossly outperform a Taxi Distance Minimization (TDM) algorithm. TRS accommodates 33% higher ride share among passengers while dealing with 44,241 requests handled by 4,000 taxis on a single day in Shanghai.
实时分布式出租车乘车共享
出租车在城市公共交通中扮演着重要的角色。通过分析上海、旧金山和纽约的出租车交通,我们发现城市内的短途出行主要是上班族在办公时间的通勤,并且跨越特定的城市区域。现在,如果大量的通勤者准备好分享他们的乘车,这将对美国和世界各地许多城市面临的“超级通勤”问题产生巨大影响。虽然拼车可以增加出租车的入住率和司机的利润,并为乘客节省开支,但它减少了总体的道路交通,从而减少了平均通勤时间和碳足迹。虽然像拼车这样的集中式拼车服务可以在一定程度上解决这个问题,但它们缺乏可扩展性和动态调整出租车时刻表以达到最佳效果的能力。在本文中,我们提出了一个四向模型来解决拼车问题,并开发了一种新的分布式出租车拼车(TRS)算法来解决拼车请求的动态调度。我们的算法显示,由于拼车,出租车行驶的总距离减少了。使用中国上海大规模出租车GPS轨迹的实证结果表明,TRS算法可以大大优于出租车距离最小化(TDM)算法。在上海,TRS每天处理4000辆出租车的44,241次请求,可容纳33%以上的乘客乘车份额。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信