A Computational Approach to Quantify the Benefits of Ridesharing for Policy Makers and Travellers

Peer-to-peer ridesharing enables people to arrange one-time rides with their own private cars, without the involvement of professional drivers. It is a prominent collective intelligence application producing significant benefits both for individuals (reduced costs) and for the entire community (reduced pollution and traffic). Despite these very promising potential advantages, the percentage of users who currently adopt ridesharing solutions is very low, well below the adoption rate required to achieve said benefits. One of the reasons of this insufficient engagement by the public is the lack of effective incentive policies by regulatory authorities, who are not able to estimate the costs and the benefits of a given ridesharing adoption policy. Here we address these issues by (i) developing a novel algorithm that makes large-scale, real-time peer-to-peer ridesharing technologically feasible; and (ii) exhaustively quantifying the impact of different ridesharing scenarios in terms of environmental benefits (i.e., reduction of CO2 emissions, noise pollution, and traffic congestion) and quality of service for the users. Our analysis on a real-world dataset shows that major societal benefits are expected from deploying peer-to-peer ridesharing depending on the trade-off between environmental benefits and quality of service. Results on a real-world dataset show that our approach can produce reductions up to a 70.78% in CO2 emissions and up to 80.08% in traffic congestion.

[1]  Martin W. P. Savelsbergh,et al.  Heuristic Optimization: A hybrid AI/OR approach , 1997 .

[2]  P. Delhomme,et al.  Comparing French carpoolers and non-carpoolers: Which factors contribute the most to carpooling? , 2016 .

[3]  Luca Becchetti,et al.  Online team formation in social networks , 2012, WWW.

[4]  Gijsjan van Bloklanda,et al.  modeling the noise emission of road vehicles and results of recent experiments , 2009 .

[5]  Sarvapali D. Ramchurn,et al.  A cooperative game-theoretic approach to the social ridesharing problem , 2017, Artif. Intell..

[6]  Russell Bent,et al.  Online stochastic combinatorial optimization , 2006 .

[7]  Bidisha Ghosh,et al.  Economic and environmental impacts of organised Car Sharing Services: A case study of Ireland , 2016 .

[8]  Biagio Ciuffo,et al.  Fuel consumption and CO2 emissions from passenger cars in Europe Laboratory versus real-world emissions , 2017 .

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

[10]  Leslie Pérez Cáceres,et al.  The irace package: Iterated racing for automatic algorithm configuration , 2016 .

[11]  Petra Mutzel,et al.  Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem , 2004, GECCO.

[12]  K. Kockelman,et al.  Carsharing’s Life-Cycle Impacts on Energy Use and Greenhouse Gas Emissions , 2016 .

[13]  Susan Shaheen,et al.  Ridesharing in North America: Past, Present, and Future , 2012 .

[14]  Kara M. Kockelman,et al.  The Travel and Environmental Implications of Shared Autonomous Vehicles, Using Agent-Based Model Scenarios , 2014 .

[15]  Kara M. Kockelman,et al.  Dynamic Ride-Sharing and Optimal Fleet Sizing for a System of Shared Autonomous Vehicles , 2015 .

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

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

[18]  Manuel López-Ibáñez,et al.  Construct , Merge , Solve & Adapt : A New General Algorithm For Combinatorial Optimization , 2015 .

[19]  Antonio Krüger,et al.  A Continuous Representation of Ad Hoc Ridesharing Potential , 2016, IEEE Transactions on Intelligent Transportation Systems.

[20]  Emilio Frazzoli,et al.  On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment , 2017, Proceedings of the National Academy of Sciences.

[21]  Paul D. Seymour,et al.  Tour Merging via Branch-Decomposition , 2003, INFORMS J. Comput..

[22]  Michael S. Bernstein,et al.  The future of crowd work , 2013, CSCW.

[23]  Uriel Feige,et al.  Heuristics for finding large independent sets, with applications to coloring semi-random graphs , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

[25]  Pascal Van Hentenryck,et al.  Column Generation for Real-Time Ride-Sharing Operations , 2019, CPAIOR.

[26]  Michael Ostrovsky,et al.  Carpooling and the Economics of Self-Driving Cars , 2018, EC.

[27]  Jie Zhang,et al.  A Discounted Trade Reduction Mechanism for Dynamic Ridesharing Pricing , 2016, IEEE Transactions on Intelligent Transportation Systems.

[28]  Franco Zambonelli,et al.  On Recommending Opportunistic Rides , 2017, IEEE Transactions on Intelligent Transportation Systems.

[29]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[30]  Itf Transition to Shared Mobility: How large cities can deliver inclusive transport services , 2017 .