Supporting Information for Quantifying the Benefits of Vehicle Pooling with Shareability Networks Data Set and Pre-processing

Significance Recent advances in information technologies have increased our participation in “sharing economies,” where applications that allow networked, real-time data exchange facilitate the sharing of living spaces, equipment, or vehicles with others. However, the impact of large-scale sharing on sustainability is not clear, and a framework to assess its benefits quantitatively is missing. For this purpose, we propose the method of shareability networks, which translates spatio-temporal sharing problems into a graph-theoretic framework that provides efficient solutions. Applying this method to a dataset of 150 million taxi trips in New York City, our simulations reveal the vast potential of a new taxi system in which trips are routinely shareable while keeping passenger discomfort low in terms of prolonged travel time. Taxi services are a vital part of urban transportation, and a considerable contributor to traffic congestion and air pollution causing substantial adverse effects on human health. Sharing taxi trips is a possible way of reducing the negative impact of taxi services on cities, but this comes at the expense of passenger discomfort quantifiable in terms of a longer travel time. Due to computational challenges, taxi sharing has traditionally been approached on small scales, such as within airport perimeters, or with dynamical ad hoc heuristics. However, a mathematical framework for the systematic understanding of the tradeoff between collective benefits of sharing and individual passenger discomfort is lacking. Here we introduce the notion of shareability network, which allows us to model the collective benefits of sharing as a function of passenger inconvenience, and to efficiently compute optimal sharing strategies on massive datasets. We apply this framework to a dataset of millions of taxi trips taken in New York City, showing that with increasing but still relatively low passenger discomfort, cumulative trip length can be cut by 40% or more. This benefit comes with reductions in service cost, emissions, and with split fares, hinting toward a wide passenger acceptance of such a shared service. Simulation of a realistic online system demonstrates the feasibility of a shareable taxi service in New York City. Shareability as a function of trip density saturates fast, suggesting effectiveness of the taxi sharing system also in cities with much sparser taxi fleets or when willingness to share is low.

[1]  Jiawei Han,et al.  ACM Transactions on Knowledge Discovery from Data: Introduction , 2007 .

[2]  K. Stowman World health statistics. , 1949, The Milbank Memorial Fund quarterly.

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

[4]  Principles and Practice of Constraint Programming — CP98 , 1999, Lecture Notes in Computer Science.

[5]  A. Hill,et al.  The possible effects of the aggregation of the molecules of haemoglobin on its dissociation curves , 1910 .

[6]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[7]  Carlo Ratti,et al.  Taxi-Aware Map: Identifying and Predicting Vacant Taxis in the City , 2010, AmI.

[8]  M. Batty The New Science of Cities , 2013 .

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

[10]  Catherine Simpson,et al.  ‘Shift – the way you move’: reconstituting automobility , 2013 .

[11]  Kentaro Uesugi,et al.  Adaptive Routing of Cruising Taxis by Mutual Exchange of Pathways , 2008, KES.

[12]  Ian A. Waitz,et al.  Air pollution and early deaths in the United States. Part I: Quantifying the impact of major sectors in 2005 , 2013 .

[13]  Irene C. Dedoussi,et al.  Air pollution and early deaths in the United States , 2014 .

[14]  W T Hung,et al.  On-Road Motor Vehicle Emissions and Fuel Consumption in Urban Driving Conditions , 2000, Journal of the Air & Waste Management Association.

[15]  Rachel Botsman,et al.  What's Mine Is Yours: The Rise of Collaborative Consumption , 2010 .

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

[17]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[18]  Guangzhong Sun,et al.  Driving with knowledge from the physical world , 2011, KDD.

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

[20]  ZVI GALIL,et al.  Efficient algorithms for finding maximum matching in graphs , 1986, CSUR.

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

[22]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[23]  Nicholas A. John The Social Logics of Sharing , 2013 .

[24]  Gillian Clare,et al.  Optimization of Taxiway Routing and Runway Scheduling , 2008, IEEE Transactions on Intelligent Transportation Systems.

[25]  Barun Chandra,et al.  Greedy local improvement and weighted set packing approximation , 2001, SODA '99.

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

[27]  Irving Langmuir,et al.  The constitution and fundamental properties of solids and liquids. Part II.—Liquids , 1917 .

[28]  K. Small,et al.  The Economics Of Traffic Congestion , 1993 .

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

[30]  Lubos Buzna,et al.  Fair sharing of resources in a supply network with constraints. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[31]  Gueorgi Kossinets,et al.  Empirical Analysis of an Evolving Social Network , 2006, Science.

[32]  Andrew J. Kean,et al.  Effects of vehicle speed and engine load on motor vehicle emissions. , 2003, Environmental science & technology.

[33]  Lin Sun,et al.  Hunting or waiting? Discovering passenger-finding strategies from a large-scale real-world taxi dataset , 2011, 2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops).

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