Price-aware real-time ride-sharing at scale: an auction-based approach

Real-time ride-sharing, which enables on-the-fly matching between riders and drivers (even en-route), is an important problem due to its environmental and societal benefits. With the emergence of many ride-sharing platforms (e.g., Uber and Lyft), the design of a scalable framework to match riders and drivers based on their various constraints while maximizing the overall profit of the platform becomes a distinguishing business strategy. A key challenge of such framework is to satisfy both types of the users in the system, e.g., reducing both riders' and drivers' travel distances. However, the majority of the existing approaches focus only on minimizing the total travel distance of drivers which is not always equivalent to shorter trips for riders. Hence, we propose a fair pricing model that simultaneously satisfies both the riders' and drivers' constraints and desires (formulated as their profiles). In particular, we introduce a distributed auction-based framework where each driver's mobile app automatically bids on every nearby request taking into account many factors such as both the driver's and the riders' profiles, their itineraries, the pricing model, and the current number of riders in the vehicle. Subsequently, the server determines the highest bidder and assigns the rider to that driver. We show that this framework is scalable and efficient, processing hundreds of tasks per second in the presence of thousands of drivers. We compare our framework with the state-of-the-art approaches in both industry and academia through experiments on New York City's taxi dataset. Our results show that our framework can simultaneously match more riders to drivers (i.e., higher service rate) by engaging the drivers more effectively. Moreover, our frame-work schedules shorter trips for riders (i.e., better service quality). Finally, as a consequence of higher service rate and shorter trips, our framework increases the overall profit of the ride-sharing platforms.

[1]  Bernhard Nebel,et al.  A Mechanism for Dynamic Ride Sharing Based on Parallel Auctions , 2011, IJCAI.

[2]  Aranyak Mehta,et al.  AdWords and generalized on-line matching , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[3]  Gilbert Laporte,et al.  The dial-a-ride problem: models and algorithms , 2006, Ann. Oper. Res..

[4]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[5]  Cyrus Shahabi,et al.  GeoCrowd: enabling query answering with spatial crowdsourcing , 2012, SIGSPATIAL/GIS.

[6]  Farnoush Banaei Kashani,et al.  Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction , 2009, SSTD.

[7]  Yu Zheng,et al.  Real-Time City-Scale Taxi Ridesharing , 2015, IEEE Transactions on Knowledge and Data Engineering.

[8]  Cláudio T. Silva,et al.  A scalable approach for data-driven taxi ride-sharing simulation , 2015, 2015 IEEE International Conference on Big Data (Big Data).

[9]  Athina Markopoulou,et al.  Assessing the Potential of Ride-Sharing Using Mobile and Social Data , 2013 .

[10]  Fernando Ordóñez,et al.  Ridesharing: The state-of-the-art and future directions , 2013 .

[11]  Ugur Demiryurek,et al.  Maximizing the number of worker's self-selected tasks in spatial crowdsourcing , 2013, SIGSPATIAL/GIS.

[12]  Eduardo C. Xavier,et al.  Dynamic Taxi and Ridesharing: A Framework and Heuristics for the Optimization Problem , 2013, IJCAI.

[13]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[14]  Ugur Demiryurek,et al.  Towards Fast and Accurate Solutions to Vehicle Routing in a Large-Scale and Dynamic Environment , 2015, SSTD.

[15]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[16]  Makoto Yokoo,et al.  Incentives in ridesharing with deficit control , 2014, AAMAS.

[17]  Eric Horvitz,et al.  Collaboration and shared plans in the open world: studies of ridesharing , 2009, IJCAI 2009.

[18]  Michail G. Lagoudakis,et al.  Simple auctions with performance guarantees for multi-robot task allocation , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[19]  Yu Zheng,et al.  T-share: A large-scale dynamic taxi ridesharing service , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[20]  Mohamed F. Mokbel,et al.  SHAREK: A Scalable Dynamic Ride Sharing System , 2015, 2015 16th IEEE International Conference on Mobile Data Management.

[21]  Paolo Santi,et al.  Supporting Information for Quantifying the Benefits of Vehicle Pooling with Shareability Networks Data Set and Pre-processing , 2022 .

[22]  Ruoming Jin,et al.  Large Scale Real-time Ridesharing with Service Guarantee on Road Networks , 2014, Proc. VLDB Endow..

[23]  Athina Markopoulou,et al.  Designing an on-line ride-sharing system , 2015, SIGSPATIAL/GIS.

[24]  Cyrus Shahabi,et al.  Task matching and scheduling for multiple workers in spatial crowdsourcing , 2015, SIGSPATIAL/GIS.

[25]  Michael Lees,et al.  A Partition-Based Match Making Algorithm for Dynamic Ridesharing , 2015, IEEE Transactions on Intelligent Transportation Systems.