SharY: a dynamic ridesharing and carpooling solution using advanced optimised algorithm
by K.M. Mehedi Hasan Sonet; Md. Mustafizur Rahman; Shoumik Rahman Mehedy; Rashedur M. Rahman
International Journal of Knowledge Engineering and Data Mining (IJKEDM), Vol. 6, No. 1, 2019

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.

Online publication date: Tue, 15-Jan-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Data Mining (IJKEDM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com