Data Analytics and Optimisation for Assessing a Ride Sharing System

• Published in: Advances in Intelligent Data Analysis XIV Vol. 9385; pp. 1 - 12
• Main Authors: Armant, Vincent, Horan, John, Mabub, Nahid, Brown, Kenneth N.
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 01.01.2015; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Artificial intelligence; Feasible Matching; Image processing; Infeasible Matches; Pattern recognition; Ride-sharing Systems; Scheduled Trip; Unmatched Participants
• ISBN: 3319244647; 9783319244648
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-24465-5_1

Ride-sharing schemes attempt to reduce road traffic by matching prospective passengers to drivers with spare seats in their cars. To be successful, such schemes require a critical mass of drivers and passengers. In current deployed implementations, the possible matches are based on heuristics, rather than real route times or distances. In some cases, the heuristics propose infeasible matches; in others, feasible matches are omitted. Poor ride matching is likely to deter participants from using the system. We develop a constraint-based model for acceptable ride matches which incorporates route plans and time windows. Through data analytics on a history of advertised schedules and agreed shared trips, we infer parameters for this model that account for 90 % of agreed trips. By applying the inferred model to the advertised schedules, we demonstrate that there is an imbalance between riders and passengers. We assess the potential benefits of persuading existing drivers to switch to becoming passengers if appropriate matches can be found, by solving the inferred model with and without switching. We demonstrate that flexible participation has the potential to reduce the number of unmatched participants by up to 80 %.