SRide: An Online System for Multi-Hop Ridesharing

Inayatullah Shah, Mohammed El Affendi and Basit Qureshi
Additional contact information
Inayatullah Shah: Department of Computer Science, Prince Sultan University, P.O. Box 66833, Riyadh 11586, Saudi Arabia
Mohammed El Affendi: Department of Computer Science, Prince Sultan University, P.O. Box 66833, Riyadh 11586, Saudi Arabia
Basit Qureshi: Department of Computer Science, Prince Sultan University, P.O. Box 66833, Riyadh 11586, Saudi Arabia

Sustainability, 2020, vol. 12, issue 22, 1-29

Abstract: In the context of smart cities, ridesharing in urban areas is gaining researchers’ interest and is considered to be a sustainable transportation solution. In this paper, we present SRide (Shared Ride), a multi-hop ridesharing system as a mode of sustainable transportation. Multi-hop ridesharing is a type of ridesharing in which a rider travels in multiple hops to reach a destination, transferring from one driver to another between hops. The key problem in multi-hop ridesharing is to find an optimal itinerary or route plan for a rider from an origin to a destination in a dynamic, online setting. SRide adopts a novel approach to finding itineraries for riders suited to the online nature of the problem. The system represents ride offers as a time-dependent directed graph and finds itineraries dynamically by updating the graph incrementally and decrementally as ride offers are updated in the system. The system’s distinguishing feature is its incremental and decremental operation, which is enabled by employing dynamic single-source shortest-path algorithms. We conducted two extensive simulation studies to evaluate its performance. Metrics, including the matching rate, savings in total system-wide vehicle-miles, and total system-wide driving times were measured. In the first study, SRide’s dynamic update algorithms were compared with their non-dynamic versions. Results show that SRide’s algorithms run up to thirteen times faster than their non-dynamic versions. In the second study, we used data from the travel demand model for metropolitan Atlanta in the US state of Georgia, to assess the benefits of multi-hop ridesharing. Results show that matching rates increase up to 68%, saving in total system-wide vehicle-miles of up to 12%, and reduction in the total system-wide driving time of up to 12.86% is achieved.

Keywords: ridesharing; ride-matching algorithms; multi-hop ridesharing; dynamic shortest-path algorithms (search for similar items in EconPapers)
JEL-codes: O13 Q Q0 Q2 Q3 Q5 Q56 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2071-1050/12/22/9633/pdf (application/pdf)
https://www.mdpi.com/2071-1050/12/22/9633/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jsusta:v:12:y:2020:i:22:p:9633-:d:447224

Access Statistics for this article

Sustainability is currently edited by Ms. Alexandra Wu

More articles in Sustainability from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().