SharY: A Dynamic Ridesharing and Carpooling Solution Using Advanced Optimized Algorithm

K. Sonet, M.-D. Arif Rahman, S. Mehedy, R. Rahman
{"title":"SharY: A Dynamic Ridesharing and Carpooling Solution Using Advanced Optimized Algorithm","authors":"K. Sonet, M.-D. Arif Rahman, S. Mehedy, R. Rahman","doi":"10.1504/IJKEDM.2019.10018091","DOIUrl":null,"url":null,"abstract":"Getting into a public transportation is now very difficult in the city of Dhaka. Moreover, they are overcrowded and getting public bus on time is also very difficult. The problem of other ride sharing services currently available in Dhaka is that if a person reserves a car, then other passengers cannot avail the car. Our main aim is to develop a match making algorithm by which a host (who offers a ride) can take multiple clients (passengers) from multiple routes efficiently without having to compromise fare, distance and other basic preferences. As in our proposed method, most of the cars offering a ride will carry passenger(s) from the host's route or multiple routes, the road utilisation will be much more effective.","PeriodicalId":110787,"journal":{"name":"International Journal of Knowledge Engineering and Data Mining","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Knowledge Engineering and Data Mining","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJKEDM.2019.10018091","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Getting into a public transportation is now very difficult in the city of Dhaka. Moreover, they are overcrowded and getting public bus on time is also very difficult. The problem of other ride sharing services currently available in Dhaka is that if a person reserves a car, then other passengers cannot avail the car. Our main aim is to develop a match making algorithm by which a host (who offers a ride) can take multiple clients (passengers) from multiple routes efficiently without having to compromise fare, distance and other basic preferences. As in our proposed method, most of the cars offering a ride will carry passenger(s) from the host's route or multiple routes, the road utilisation will be much more effective.
基于先进优化算法的动态拼车解决方案
在达卡,乘坐公共交通工具现在非常困难。此外,他们拥挤不堪,准时乘坐公共汽车也很困难。达卡目前提供的其他拼车服务的问题是,如果一个人预订了一辆车,那么其他乘客就无法使用这辆车。我们的主要目标是开发一种匹配算法,通过这种算法,房东(提供乘车服务的人)可以有效地从多条路线上搭载多个客户(乘客),而无需妥协票价、距离和其他基本偏好。在我们提出的方法中,大多数提供乘车服务的汽车将从主人的路线或多条路线搭载乘客,道路利用将更加有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信