Discovering Regularity in Mobility Patterns to Identify Predictable Aggregate Supply for Ridesharing

Heterogeneous data collected by smartphone sensors offer new opportunities to study a person’s mobility behavior. The mobility patterns extracted from the travel histories found in these data enable agents residing in mobile devices to model transitions between visited locations, so that upcoming trips can be predicted after observing a set of events, and assistance can be planned in advance. When several agents cooperate, the forecasted trips made by multiple users can provide a potential supply for shared mobility systems such as dynamic ridesharing. These trips must be sufficiently regular and frequent to be reliably announced as shareable trips. This paper describes a methodology to identify a predictable aggregate supply for ridesharing via mobility patterns discovered in users’ travel histories. The methodology empirically quantifies measures like the regularity and frequency of these patterns on a dataset consisting of 967 users scattered across different geographical areas. The sample exhibits high heterogeneity with respect to these measures (hence, of predictability, regardless of the prediction method). This paper shows how frequency of trip patterns decreases, while regularity increases, when additional dimensions such as departure times are added to the analysis. It was concluded that the traveler flexibility with regard to accepting less regular trips is vital to discover a larger supply. These results provide insights to develop future applications able to take advantage of this approach, to increase ridesharing rates, allowing a critical mass to be more easily attained.

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

[2]  Thad Starner,et al.  Using GPS to learn significant locations and predict movement across multiple users , 2003, Personal and Ubiquitous Computing.

[3]  Stuart M. Allen,et al.  Measuring Individual Regularity in Human Visiting Patterns , 2012, 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing.

[4]  Kotagiri Ramamohanarao,et al.  Optimal Pick up Point Selection for Effective Ride Sharing , 2017, IEEE Transactions on Big Data.

[5]  Marta C. González,et al.  Assessing the Impact of Real-time Ridesharing on Urban Traffic using Mobile Phone Data , 2015 .

[6]  Nicholas Jing Yuan,et al.  Regularity and Conformity: Location Prediction Using Heterogeneous Mobility Data , 2015, KDD.

[7]  Martin W. P. Savelsbergh,et al.  Optimization for dynamic ride-sharing: A review , 2012, Eur. J. Oper. Res..

[8]  M. Braga,et al.  Exploratory Data Analysis , 2018, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[9]  Niels A. H. Agatz,et al.  The Benefits of Meeting Points in Ride-Sharing Systems , 2015 .

[10]  Rich Caruana,et al.  Greedy Attribute Selection , 1994, ICML.

[11]  Thad Starner,et al.  Learning Significant Locations and Predicting User Movement with GPS , 2002, Proceedings. Sixth International Symposium on Wearable Computers,.

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

[13]  Martin W. P. Savelsbergh,et al.  Making dynamic ride-sharing work: The impact of driver and rider flexibility , 2016 .

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

[15]  Wen-Jing Hsu,et al.  Mining GPS data for mobility patterns: A survey , 2014, Pervasive Mob. Comput..

[16]  Hans-Peter Kriegel,et al.  OPTICS: ordering points to identify the clustering structure , 1999, SIGMOD '99.

[17]  M. Batty,et al.  Variability in Regularity: Mining Temporal Mobility Patterns in London, Singapore and Beijing Using Smart-Card Data , 2016, PloS one.

[18]  Xing Xie,et al.  Mining interesting locations and travel sequences from GPS trajectories , 2009, WWW '09.

[19]  Sourav Bhattacharya,et al.  Identifying Meaningful Places: The Non-parametric Way , 2009, Pervasive.

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

[21]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[22]  Chris M.J. Tampère,et al.  Anticipatory Assistance for Real Time Ride-Sharing in Environments of Pervasive Computing , 2016 .