Ant-Taxi to Pie-Passenger: Optimizing Routes and Time for Distributed Taxi Ride Sharing

A. Manjunath, V. Raychoudhury, Snehanshu Saha
{"title":"Ant-Taxi to Pie-Passenger: Optimizing Routes and Time for Distributed Taxi Ride Sharing","authors":"A. Manjunath, V. Raychoudhury, Snehanshu Saha","doi":"10.1109/COMSNETS48256.2020.9027410","DOIUrl":null,"url":null,"abstract":"Sustainability of local co-operative taxi networks in the face of competition from corporate behemoths is a problem worthy of investigation. Lack of infrastructure background support and venture capital demands alternative strategies for survival. A viable solution requires novel modeling approach and computational framework. Such framework needs to be fully distributed and therefore is sub-optimal. We propose an intra-city taxi service that leverages individual rides and local network for ride management. This, in turn, demands a bunch of decision variables and objectives to be optimized. Some of these objectives are conflicting and therefore the problem requires a multi objective optimization formulation. We propose to exploit the flexible structure and multi-agent like behavior of Ant colony optimization to tackle the diversity of objectives in the ride share problem. We consider the scenario of ride share only since that is the hardest part in the taxi business. The implementation is multi-modular and provides an alternative approach to commonly used centralized taxi network. We define novel performance metrics and present results to supplement the modeling approach. Our results show that spatio-temporal diversity is the biggest road block to wide scale ride sharing. Nonetheless, our solution ensures up to 77% acceptance in shared rides.","PeriodicalId":265871,"journal":{"name":"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS48256.2020.9027410","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Sustainability of local co-operative taxi networks in the face of competition from corporate behemoths is a problem worthy of investigation. Lack of infrastructure background support and venture capital demands alternative strategies for survival. A viable solution requires novel modeling approach and computational framework. Such framework needs to be fully distributed and therefore is sub-optimal. We propose an intra-city taxi service that leverages individual rides and local network for ride management. This, in turn, demands a bunch of decision variables and objectives to be optimized. Some of these objectives are conflicting and therefore the problem requires a multi objective optimization formulation. We propose to exploit the flexible structure and multi-agent like behavior of Ant colony optimization to tackle the diversity of objectives in the ride share problem. We consider the scenario of ride share only since that is the hardest part in the taxi business. The implementation is multi-modular and provides an alternative approach to commonly used centralized taxi network. We define novel performance metrics and present results to supplement the modeling approach. Our results show that spatio-temporal diversity is the biggest road block to wide scale ride sharing. Nonetheless, our solution ensures up to 77% acceptance in shared rides.
从“反出租车”到“派乘客”:分布式出租车拼车路线和时间的优化
面对企业巨头的竞争,地方合作出租车网络的可持续性是一个值得研究的问题。缺乏基础设施背景支持和风险资本,需要其他生存战略。一个可行的解决方案需要新颖的建模方法和计算框架。这样的框架需要完全分布式,因此不是最优的。我们提出了一种利用个人乘车和本地网络进行乘车管理的城市内出租车服务。这反过来又要求优化一系列决策变量和目标。其中一些目标是相互冲突的,因此这个问题需要一个多目标优化公式。我们提出利用蚁群优化的灵活结构和多智能体行为来解决拼车问题中的目标多样性问题。我们只考虑拼车的情况,因为这是出租车业务中最难的部分。实现是多模块化的,提供了一种替代常用的集中式出租车网络的方法。我们定义了新的性能指标,并给出了结果来补充建模方法。研究结果表明,时空多样性是实现大规模拼车的最大障碍。尽管如此,我们的解决方案确保了77%的共享乘车接受度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信