Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
7539362 | Transportation Research Part B: Methodological | 2017 | 19 Pages |
Abstract
Real-time peer-to-peer ridesharing is a promising mode of transportation that has gained popularity during the recent years thanks to the wide-spread use of smart phones, mobile application development platforms, and online payment systems. An assignment of drivers to riders, known as the ride-matching problem, is a central component of a peer-to-peer ridesharing system. In this paper we discuss the features of a flexible ridesharing system and propose an algorithm to optimally solve the ride-matching problem in a flexible ridesharing system in real-time. We generate random instances of the problem, and perform sensitivity analysis over some of the important parameters in a ridesharing system. Furthermore, we discuss two novel approaches to increase the performance of a ridesharing system.
Related Topics
Social Sciences and Humanities
Decision Sciences
Management Science and Operations Research
Authors
Neda Masoud, R. Jayakrishnan,