Social or Green? A Data-Driven Approach for More Enjoyable Carpooling

Carpooling, i.e. the sharing of vehicles to reach common destinations, is often performed to reduce costs and pollution. Recent works on carpooling and journey planning take into account, besides mobility match, also social aspects and, more generally, non-monetary rewards. In line with this, we present a data-driven methodology for a more enjoyable carpooling. We introduce a measure of enjoyability based on people's interests, social links, and tendency to connect to people with similar or dissimilar interests. We devise a methodology to compute enjoyability from crowd-sourced data, and we show how this can be used on real world datasets to optimize for both mobility and enjoyability. Our methodology was tested on real data from Rome and San Francisco. We compare the results of an optimization model minimizing the number of cars, and a greedy approach maximing the enjoyability. We evaluate them in terms of cars saved, and average enjoyability of the system. We present also the results of a user study, with more than 200 users reporting an interest of 39% in the enjoyable solution. Moreoever, 24% of people declared that sharing the car with interesting people would be the primary motivation for carpooling.

[1]  Fosca Giannotti,et al.  Mining mobility user profiles for car pooling , 2011, KDD.

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

[3]  Jure Leskovec,et al.  Friendship and mobility: user movement in location-based social networks , 2011, KDD.

[4]  Chang-Tien Lu,et al.  A carpooling recommendation system based on social VANET and geo-social data , 2013, SIGSPATIAL/GIS.

[5]  Víctor Soto,et al.  Characterizing Urban Landscapes Using Geolocated Tweets , 2012, 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing.

[6]  Chai Wah Wu,et al.  The optimality of the online greedy algorithm in carpool and chairman assignment problems , 2011, TALG.

[7]  G. Correia,et al.  Carpooling and carpool clubs: Clarifying concepts and assessing value enhancement possibilities through a Stated Preference web survey in Lisbon, Portugal , 2011 .

[8]  Davy Janssens,et al.  Estimating Scalability Issues While Finding an Optimal Assignment for Carpooling , 2013, ANT/SEIT.

[9]  Deyi Li,et al.  Mining regular routes from GPS data for ridesharing recommendations , 2012, UrbComp '12.

[10]  Rossano Schifanella,et al.  The shortest path to happiness: recommending beautiful, quiet, and happy routes in the city , 2014, HT.

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

[12]  J. Munkres ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .

[13]  Marco Mamei,et al.  Investigating ride sharing opportunities through mobility data analysis , 2014, Pervasive Mob. Comput..

[14]  Rudolf Schneider,et al.  On the chairman assignment problem , 1996, Discret. Math..

[15]  Steve H. L. Liang,et al.  Crowd-sourced carpool recommendation based on simple and efficient trajectory grouping , 2011, CTS '11.

[16]  Joonsang Baek,et al.  Feasibility analysis of transportation applications based on APIs of social network services , 2013, 8th International Conference for Internet Technology and Secured Transactions (ICITST-2013).