Intelligent Carpool Routing for Urban Ridesharing by Mining GPS Trajectories

To support an efficient carpooling service in heavy urban traffic, we propose an intelligent routing scheme based on mining Global Position System trajectories from shared riders. The carpooling system provides many-to-many services with multiple pickup and dropping points. To join a daily carpooling group, the riders must accept a compromised route that is efficient after merging the routes that are preferred by all qualified riders. We developed three frequency-correlated algorithms for route mining, rider selection, and route merging in an urban carpool service. Our approach can cope with the traffic dynamics to yield a suboptimal shared route. Our scheme was successfully tested under heavy Beijing traffic over hundreds of riders. We developed performance metrics to measure the service cost and mileage saved. The ultimate goal is to minimize the riding distances and the transportation costs, and thus alleviate urban traffic jams.

[1]  Panos Kalnis,et al.  User oriented trajectory search for trip recommendation , 2012, EDBT '12.

[2]  Chengbin Chu,et al.  The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments , 2008, Eur. J. Oper. Res..

[3]  Seung-won Hwang,et al.  Supporting Pattern-Matching Queries over Trajectories on Road Networks , 2011, IEEE Transactions on Knowledge and Data Engineering.

[4]  Ramayya Krishnan,et al.  Adaptive collective routing using gaussian process dynamic congestion models , 2013, KDD.

[5]  Mi-Yen Yeh,et al.  Discovering personalized routes from trajectories , 2011, LBSN '11.

[6]  Roberto Baldacci,et al.  An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation , 2004, Oper. Res..

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

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

[9]  Ling Chen,et al.  A personal route prediction system based on trajectory data mining , 2011, Inf. Sci..

[10]  Siyuan Liu,et al.  Towards mobility-based clustering , 2010, KDD.

[11]  Xinyi Zhang,et al.  Algorithms for the carpool problem , 1999 .

[12]  Shangyao Yan,et al.  A Model With a Heuristic Algorithm for Solving the Long-Term Many-to-Many Car Pooling Problem , 2011, IEEE Transactions on Intelligent Transportation Systems.

[13]  Dino Pedreschi,et al.  Trajectory pattern mining , 2007, KDD '07.

[14]  Brian Coltin,et al.  Towards Ridesharing with Passenger Transfers (Extended Abstract) , 2013 .

[15]  Eric Horvitz,et al.  Collaboration and shared plans in the open world: studies of ridesharing , 2009, IJCAI 2009.

[16]  Jae-Gil Lee,et al.  Mining Discriminative Patterns for Classifying Trajectories on Road Networks , 2011, IEEE Transactions on Knowledge and Data Engineering.

[17]  Matthias Grossglauser,et al.  Trajectory sampling for direct traffic observation , 2000, SIGCOMM 2000.

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

[19]  Xing Xie,et al.  GeoLife: A Collaborative Social Networking Service among User, Location and Trajectory , 2010, IEEE Data Eng. Bull..

[20]  Vittorio Maniezzo,et al.  A distributed geographic information system for the daily car pooling problem , 2004, Comput. Oper. Res..

[21]  Wei-Ying Ma,et al.  Understanding mobility based on GPS data , 2008, UbiComp.

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

[23]  Ali Haghani,et al.  Real-Time Rideshare Matching Problem , 2010 .

[24]  Chun-Yen Chang,et al.  Passenger Search by Spatial Index for Ridesharing , 2011, 2011 International Conference on Technologies and Applications of Artificial Intelligence.

[25]  Niels A. H. Agatz,et al.  The Value of Optimization in Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta , 2010 .