Real-Time City-Scale Taxi Ridesharing

被引:260
作者
Ma, Shuo [1 ]
Zheng, Yu [2 ]
Wolfson, Ouri [1 ]
机构
[1] Univ Illinois, Dept Comp Sci, Chicago, IL 60607 USA
[2] Microsoft Res, Beijing 100080, Peoples R China
基金
美国国家科学基金会;
关键词
Spatial databases and GIS; taxi-sharing; GPS trajectory; ridesharing; urban computing; intelliegent transportation systems;
D O I
10.1109/TKDE.2014.2334313
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We proposed and developed a taxi-sharing system that accepts taxi passengers' real-time ride requests sent from smartphones and schedules proper taxis to pick up them via ridesharing, subject to time, capacity, and monetary constraints. The monetary constraints provide incentives for both passengers and taxi drivers: passengers will not pay more compared with no ridesharing and get compensated if their travel time is lengthened due to ridesharing; taxi drivers will make money for all the detour distance due to ridesharing. While such a system is of significant social and environmental benefit, e. g., saving energy consumption and satisfying people's commute, real-time taxi-sharing has not been well studied yet. To this end, we devise a mobile-cloud architecture based taxi-sharing system. Taxi riders and taxi drivers use the taxi-sharing service provided by the system via a smart phone App. The Cloud first finds candidate taxis quickly for a taxi ride request using a taxi searching algorithm supported by a spatio-temporal index. A scheduling process is then performed in the cloud to select a taxi that satisfies the request with minimum increase in travel distance. We built an experimental platform using the GPS trajectories generated by over 33,000 taxis over a period of three months. A ride request generator is developed (available at http://cs.uic.edu/similar to sma/ridesharing) in terms of the stochastic process modelling real ride requests learned from the data set. Tested on this platform with extensive experiments, our proposed system demonstrated its efficiency, effectiveness and scalability. For example, when the ratio of the number of ride requests to the number of taxis is 6, our proposed system serves three times as many taxi riders as that when no ridesharing is performed while saving 11 percent in total travel distance and 7 percent taxi fare per rider.
引用
收藏
页码:1782 / 1795
页数:14
相关论文
共 32 条
[1]   A data distributed parallel algorithm for nonrigid image registration [J].
Ino, F ;
Ooyama, K ;
Hagihara, K .
PARALLEL COMPUTING, 2005, 31 (01) :19-43
[2]  
Balan R.K., 2011, Proceedings from MobiSys '11: The 9th international conference on Mobile systems, applications, and services, P99
[3]   An exact method for the car pooling problem based on Lagrangean column generation [J].
Baldacci, R ;
Maniezzo, V ;
Mingozzi, A .
OPERATIONS RESEARCH, 2004, 52 (03) :422-439
[4]   Dynamic transportation of patients in hospitals [J].
Beaudry, Alexandre ;
Laporte, Gilbert ;
Melo, Teresa ;
Nickel, Stefan .
OR SPECTRUM, 2010, 32 (01) :77-107
[5]   A distributed geographic information system for the daily car pooling problem [J].
Calvo, RW ;
de Luigi, F ;
Haastrup, P ;
Maniezzo, V .
COMPUTERS & OPERATIONS RESEARCH, 2004, 31 (13) :2263-2278
[6]  
Chen J, 2013, INT NANOELECTR CONF, P437, DOI 10.1109/INEC.2013.6466071
[7]  
Chen P.-Y., 2010, P 2010 IEEE 72 VEH T, P1
[8]   The dial-a-ride problem: models and algorithms [J].
Cordeau, Jean-Francois ;
Laporte, Gilbert .
ANNALS OF OPERATIONS RESEARCH, 2007, 153 (01) :29-46
[9]   A branch-and-cut algorithm for the dial-a-ride problem [J].
Cordeau, Jean-Francois .
OPERATIONS RESEARCH, 2006, 54 (03) :573-586
[10]   A tabu search heuristic for the static multi-vehicle dial-a-ride problem [J].
Cordeau, JF ;
Laporte, G .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (06) :579-594