STaRS: Simulating Taxi Ride Sharing at Scale

As urban populations grow, cities face many challenges related to transportation, resource consumption, and the environment. Ride sharing has been proposed as an effective approach to reduce traffic congestion, gasoline consumption, and pollution. However, despite great promise, researchers and policy makers lack adequate tools to assess the tradeoffs and benefits of various ride-sharing strategies. In this paper, we propose a real-time, data-driven simulation framework that supports the efficient analysis of taxi ride sharing. By modeling taxis and trips as distinct entities, our framework is able to simulate a rich set of realistic scenarios. At the same time, by providing a comprehensive set of parameters, we are able to study the taxi ride-sharing problem from different angles, considering different stakeholders’ interests and constraints. To address the computational complexity of the model, we describe a new optimization algorithm that is linear in the number of trips and makes use of an efficient indexing scheme, which combined with parallelization, makes our approach scalable. We evaluate our framework through a study that uses data about 360 million trips taken by 13,000 taxis in New York City during 2011 and 2012. We describe the findings of the study which demonstrate that our framework can provide insights into strategies for implementing city-wide ride-sharing solutions. We also carry out a detailed performance analysis which shows the efficiency of our approach.

[1]  R. Stephenson A and V , 1962, The British journal of ophthalmology.

[2]  V. Z. NEWCOMBE,et al.  Urban Development , 2020, Nature.

[3]  Irwin P. Levin,et al.  Ride Sharing: Psychological Factors , 1977 .

[4]  M. Ben-Ariva,et al.  METHODOLOGY FOR SHORT-RANGE TRAVEL DEMAND PREDICTIONS. ANALYSIS OF CARPOOLING INCENTIVES , 1977 .

[5]  R. Teal Carpooling: Who, how and why☆ , 1987 .

[6]  Douglas Lewin,et al.  Advanced computer architectures , 1992 .

[7]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[8]  Michael Jünger,et al.  A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints , 2000, Comput. Optim. Appl..

[9]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[10]  Jian Yang,et al.  Real-Time Multivehicle Truckload Pickup and Delivery Problems , 2004, Transp. Sci..

[11]  Henry S. Farber,et al.  Is Tomorrow Another Day? The Labor Supply of New York City Cabdrivers , 2005, Journal of Political Economy.

[12]  Ángel Marín,et al.  Airport management: taxi planning , 2006, Ann. Oper. Res..

[13]  C. Morency The ambivalence of ridesharing , 2007 .

[14]  Arthur Richards,et al.  Optimization of Taxiway Routing and Runway Scheduling , 2008, IEEE Transactions on Intelligent Transportation Systems.

[15]  Gilbert Laporte,et al.  Dynamic pickup and delivery problems , 2010, Eur. J. Oper. Res..

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

[17]  Michael Weber,et al.  A genetic and insertion heuristic algorithm for solving the dynamic ridematching problem with time windows , 2012, GECCO '12.

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

[19]  Danny Hendler,et al.  Lightweight Contention Management for Efficient Compare-and-Swap Operations , 2013, Euro-Par.

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

[21]  Manuela M. Veloso,et al.  Scheduling for Transfers in Pickup and Delivery Problems with Very Large Neighborhood Search , 2014, AAAI.

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

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