Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions

Amirmahdi Tafreshian (), Neda Masoud () and Yafeng Yin ()
Additional contact information
Amirmahdi Tafreshian: Department of Civil and Environmental Engineering, University of Michigan, Ann Arbor, Michigan 48109
Neda Masoud: Department of Civil and Environmental Engineering, University of Michigan, Ann Arbor, Michigan 48109
Yafeng Yin: Department of Civil and Environmental Engineering, University of Michigan, Ann Arbor, Michigan 48109

Service Science, 2020, vol. 12, issue 2-3, 44–60

Abstract: As a consequence of the sharing economy attaining more popularity, there has been a shift toward shared-use mobility services in recent years, especially those that encourage users to share their personal vehicles with others. To date, different variants of these services have been proposed that call for different settings and give rise to different research questions. Peer-to-peer (P2P) ride sharing is one such service that provides a platform for drivers to share their personal trips with riders who have similar itineraries. Unlike ride-sourcing services, drivers in P2P ride sharing have their own individual trips to make and are not driving for the sole purpose of serving rider requests. Unlike traditional carpooling, P2P ride sharing can serve on-demand and one-time trip requests. P2P ride sharing has been identified as a sustainable mode of transportation that results in several individual and societal benefits. The core of a P2P ride-sharing system is a ride-matching problem that determines ride-sharing plans for users. This paper reviews the major studies on the operations of P2P ride-sharing systems, with a focus on modeling and solution methodologies for matching, routing, and scheduling. In this paper, we classify ride-sharing systems based on their operational features and review the existing methodologies for each class. We further discuss a number of important directions for future research.

Keywords: peer-to-peer ride sharing; dynamic ride sharing; carpooling; ride-matching problem (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (24)

Downloads: (external link)
https://doi.org/10.1287/serv.2020.0258 (application/pdf)

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:inm:orserv:v:12:y:2020:i:2-3:p:44-60

Access Statistics for this article

More articles in Service Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().