{"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.