A Dynamic Taxi Ride Sharing System Using Particle Swarm Optimization

Shrawani Silwal, V. Raychoudhury, Snehanshu Saha, Md Osman Gani
{"title":"A Dynamic Taxi Ride Sharing System Using Particle Swarm Optimization","authors":"Shrawani Silwal, V. Raychoudhury, Snehanshu Saha, Md Osman Gani","doi":"10.1109/MASS50613.2020.00024","DOIUrl":null,"url":null,"abstract":"With the rapid growth of on-demand taxi services, like Uber, Lyft, etc., urban public transportation scenario is shifting towards a personalized transportation choice for most commuters. While taxi rides are comfortable and time efficient, they often lead to higher cost and road congestion due to lower overall occupancy than bigger vehicles. One efficient way to improve taxi occupancy is to adopt ride sharing. Existing ride sharing solutions are mostly centralized and proprietary. Moreover, given the wide spatio-temporal variation of incoming ride requests designing a dynamic and distributed shared-ride scheduling system is NP-hard. In this paper, we have proposed a publisher (passengers) and subscriber (taxis) based ride sharing system that provides effective real-time ride scheduling for multiple passengers. A particle swarm based route optimization strategy has been applied to determine the most preferable route for passengers. Empirical analysis using large scale single-user taxi ride records from Chicago Transit Authority, show that, our proposed system, ensures a maximum of 91.74% and 63.29% overall success rates during non-peak and peak hours, respectively.","PeriodicalId":105795,"journal":{"name":"2020 IEEE 17th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 17th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASS50613.2020.00024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid growth of on-demand taxi services, like Uber, Lyft, etc., urban public transportation scenario is shifting towards a personalized transportation choice for most commuters. While taxi rides are comfortable and time efficient, they often lead to higher cost and road congestion due to lower overall occupancy than bigger vehicles. One efficient way to improve taxi occupancy is to adopt ride sharing. Existing ride sharing solutions are mostly centralized and proprietary. Moreover, given the wide spatio-temporal variation of incoming ride requests designing a dynamic and distributed shared-ride scheduling system is NP-hard. In this paper, we have proposed a publisher (passengers) and subscriber (taxis) based ride sharing system that provides effective real-time ride scheduling for multiple passengers. A particle swarm based route optimization strategy has been applied to determine the most preferable route for passengers. Empirical analysis using large scale single-user taxi ride records from Chicago Transit Authority, show that, our proposed system, ensures a maximum of 91.74% and 63.29% overall success rates during non-peak and peak hours, respectively.
基于粒子群优化的动态出租车拼车系统
随着Uber、Lyft等按需打车服务的快速发展,城市公共交通场景正在向大多数通勤者的个性化交通选择转变。虽然乘坐出租车舒适且省时,但由于总体入住率低于大型车辆,它们往往会导致更高的成本和道路拥堵。提高出租车入住率的一个有效方法是采用拼车。现有的拼车解决方案大多是集中和专有的。此外,考虑到进入的乘车请求的大时空变化,设计一个动态和分布式的共享乘车调度系统是np困难的。在本文中,我们提出了一个基于发布者(乘客)和订阅者(出租车)的拼车系统,为多名乘客提供有效的实时拼车调度。采用基于粒子群的路线优化策略,为乘客确定最优路线。利用芝加哥交通管理局(Chicago Transit Authority)的大规模单用户出租车乘坐记录进行的实证分析表明,我们提出的系统在非高峰和高峰时段的总体成功率分别最高为91.74%和63.29%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信