Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Real-Time City-Scale Taxi Ridesharing

Published: 01 July 2015 Publication History

Abstract

We proposed and developed a taxi-sharing system that accepts taxi passengers' real-time ride requests sent from smart phones and schedules proper taxis to pick up them via ride sharing, 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 ride sharing and get compensated if their travel time is lengthened due to ride sharing; taxi drivers will make money for all the detour distance due to ride sharing. 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/~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.

References

[1]
R. Baldacci, V. Maniezzo, and A. Mingozzi, “An exact method for the car pooling problem based on lagrangean column generation,” Oper. Res. , vol. 52, no. 3, pp. 422–439, 2004.
[2]
R. W. Calvo, F. de Luigi, P. Haastrup, and V. Maniezzo, “A distributed geographic information system for the daily carpooling problem,” Comput. Oper. Res., vol. 31, pp. 2263–2278, 2004.
[3]
S. Ma, Y. Zheng, and O. Wolfson, “T-Share: A large-scale dynamic ridesharing service,” in Proc. 29th IEEE Int. Conf. Data Eng., 2013, pp. 410–421.
[4]
E. Kamar and E. Horvitz, “Collaboration and shared plans in the open world: Studies of ridesharing,” in Proc. 21st Int. Jont Conf. Artif. Intell., 2009, pp. 187– 194.
[5]
K. Wong, I. Bell, and G. H. Michael, “Solution of the dial-a-ride problem with multi-dimensional capacity constraints,” Int. Trans. Oper. Res., vol. 13, no. 3, pp. 195–208, May 2006.
[6]
Z. Xiang, C. Chu, and H. Chen, “A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints,” Eur. J. Oper. Res., vol. 174, no. 2, pp. 1117– 1139, 2006.
[7]
J. Yuan, Y. Zheng, C. Zhang, W. Xie, X. Xie, G. Sun, and Y. Huang, “T-drive: Driving directions based on taxi trajectories,” in Proc. 18th SIGSPATIAL Int. Conf. Adv. Geographic Inf. Syst., 2010, pp. 99–108.
[8]
J. Yuan, Y. Zheng, X. Xie, and G. Sun, “Driving with knowledge from the physical world,” in Proc. 17th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2011, pp. 316–324.
[9]
O. Wolfson, A. P. Sistla, B. Xu, J. Zhou, S. Chamberlain, Y. Yesha, and N. Rishe, “Tracking moving objects using database technology in DOMINO,” in Proc. 4th Int. Workshop Next Generation Inf. Technol. Syst., 1999, pp. 112–119.
[10]
J. Yuan, Y. Zheng, C. Zhang, X. Xie, and G.-Z. Sun, “An interactive-voting based map matching algorithm,” in Proc. 11th Int. Conf. Mobile Data Manage., 2010, pp. 43– 52.
[11]
J. Yuan, Y. Zheng, L. Zhang, Xi. Xie, and G. Sun, “Where to find my next passenger,” in Proc. 13th Int. Conf. Ubiquitous Comput., 2011, pp. 109–118.
[12]
Y. Ge, H. Xiong, A. Tuzhilin, K. Xiao, M. Gruteser, and M. Pazzani, “ An energy-efficient mobile recommender system,” in Proc. 16th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2010, pp. 899–908.
[13]
R. Balan, K. Nguyen, and L. Jiang, “Real-time trip information service for a large taxi fleet,” in Proc. 9th Int. Conf. Mob. Syst. Appl. Serv., 2011, pp. 99–112.
[14]
K. Yamamoto, K. Uesugi, and T. Watanabe, “Adaptive routing of cruising taxis by mutual exchange of pathways,” in Proc. 12th Int. Conf. Knowledge-Based Intell. Inf. Eng. Syst., Part II, 2008, pp. 559–566.
[15]
D. Santani, R. K. Balan, and C. J. Woodard, “ Spatio-temporal efficiency in a taxi dispatch system,” Research Collection School Of Information Systems, Singapore Management University, Oct. 2008.
[16]
D. Zhang and T. He, “CallCab: A unified recommendation system for carpooling and regular taxicab services,” in Proc. IEEE Int. Conf. Big Data, 2013, pp. 439 –447.
[17]
W. Wu, W. S. Ng, S. Krishnaswamy, and A. Sinha, “To Taxi or Not to Taxi?—Enabling personalised and real-time transportation decisions for mobile users,” in Proc. IEEE 13th Int. Conf. Mob. Data Manage., Jul. 2012, pp. 320–323.
[18]
Y. Dumas, J. Desrosiers, and F. Soumis, “ The pickup and delivery problem with time windows,” Eur. J. Oper. Res. , vol. 54, no. 1, pp. 7–22, Sep. 1991.
[19]
A. Beaudry, G. Laporte, T. Melo, and S. Nickel, “Dynamic transportation of patients in hospitals,” OR Spectr., vol. 32, no. 1, pp. 77–107, 2010.
[20]
J. Cordeau, “A branch-and-cut algorithm for the dial-a-ride problem,” Oper. Res., vol. 54, pp. 573–586, 2003.
[21]
L. M. Hvattum, A. Løkketangen, and G. Laporte, “ A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems,” Networks, vol. 49, no. 4, pp. 330– 340, Jul. 2007.
[22]
J.-F. Cordeau and G. Laporte, “The dial-a-ride problem: Models and algorithms,” Ann. Oper. Res. , vol. 153, no. 1, 2007.
[23]
C. J.-F. and L. G., “A tabu search heuristic for the static multi-vehicle dial-a-ride problem,” Transp. Res. Part B Methodol., vol. 37, no. 6, pp. 579–594, 2003.
[24]
A. Attanasio, J.-F. Cordeau, G. Ghiani, and G. Laporte, “Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem,” Parallel Comput., vol. 30, no. 3, pp. 377–387, Mar. 2004 .
[25]
M. E. T. Horn, “Fleet scheduling and dispatching for demand-responsive passenger services,” Transp. Res. Part C Emerg. Technol., vol. 10, no. 1, pp. 35–63, 2002.
[26]
P.-Y. Chen, J.-W. Liu, and W.-T. Chen, “A fuel-saving and pollution-reducing dynamic taxi-sharing protocol in VANETs,” in Proc. IEEE 72nd Veh. Technol. Conf., Sep. 2010, pp. 1–5.
[27]
P. M. d’Orey, R. Fernandes, and M. Ferreira, “Empirical evaluation of a dynamic and distributed taxi-sharing system,” in Proc. 15th Int. IEEE Conf. Intell. Transp. Syst., Sep. 2012, pp. 140–146.
[28]
G. Gidofalvi, T. B. Pedersen, T. Risch, and E. Zeitler, “Highly scalable trip grouping for large-scale collective transportation systems,” in Proc. 11th Int. Conf. Extending Database Technol.: Adv. Database Technol., 2008, pp. 678–689 .
[29]
S. Ma and O. Wolfson, “ Analysis and evaluation of the slugging form of ridesharing,” in Proc. 21st ACM SIGSPATIAL Int. Conf. Adv. Geographic Inf. Syst., 2013, pp. 64– 73.
[30]
G. Gidofalvi and T. Pedersen, “Cab-sharing: An effective, door-to-door, on-demand transportation service,” in Proc. 6th Eur. Congr. Intell. Transp. Syst. Serv., 2007.
[31]
Y. Zheng, L. Capra, O. Wolfson, and H. Y., “Urban Computing: Concepts, methodologies, and applications,” ACM Trans. Intell. Syst. Technol., vol. 5, no. 3, article 38, Sep. 2014.
[32]
Y. Wang, Y. Zheng, and Y. Xue, “Travel time estimation of a path using sparse trajectories,” in Proc. 20th ACM SIGKDD (KDD '14) , ACM, New York, NY, USA, 2014, pp. 25–34.

Cited By

View all
  • (2024)Real-Time Insertion Operator for Shared Mobility on Time-Dependent Road NetworksProceedings of the VLDB Endowment10.14778/3654621.365463317:7(1669-1682)Online publication date: 1-Mar-2024
  • (2024)Enhancing Urban Mobility Through Peer-to-Peer Ride-Sharing: A System-Wide Impact AssessmentProceedings of the 2nd ACM SIGSPATIAL Workshop on Sustainable Urban Mobility10.1145/3681779.3696842(18-26)Online publication date: 29-Oct-2024
  • (2024)Utility-Aware Dynamic Ridesharing in Spatial CrowdsourcingIEEE Transactions on Mobile Computing10.1109/TMC.2022.323221523:2(1066-1079)Online publication date: 1-Feb-2024
  • Show More Cited By

Index Terms

  1. Real-Time City-Scale Taxi Ridesharing
          Index terms have been assigned to the content through auto-classification.

          Recommendations

          Comments

          Information & Contributors

          Information

          Published In

          cover image IEEE Transactions on Knowledge and Data Engineering
          IEEE Transactions on Knowledge and Data Engineering  Volume 27, Issue 7
          July 2015
          281 pages

          Publisher

          IEEE Educational Activities Department

          United States

          Publication History

          Published: 01 July 2015

          Author Tags

          1. intelliegent transportation systems
          2. Spatial databases and GIS
          3. taxi-sharing
          4. GPS trajectory
          5. ridesharing
          6. urban computing

          Qualifiers

          • Research-article

          Contributors

          Other Metrics

          Bibliometrics & Citations

          Bibliometrics

          Article Metrics

          • Downloads (Last 12 months)0
          • Downloads (Last 6 weeks)0
          Reflects downloads up to 14 Jan 2025

          Other Metrics

          Citations

          Cited By

          View all
          • (2024)Real-Time Insertion Operator for Shared Mobility on Time-Dependent Road NetworksProceedings of the VLDB Endowment10.14778/3654621.365463317:7(1669-1682)Online publication date: 1-Mar-2024
          • (2024)Enhancing Urban Mobility Through Peer-to-Peer Ride-Sharing: A System-Wide Impact AssessmentProceedings of the 2nd ACM SIGSPATIAL Workshop on Sustainable Urban Mobility10.1145/3681779.3696842(18-26)Online publication date: 29-Oct-2024
          • (2024)Utility-Aware Dynamic Ridesharing in Spatial CrowdsourcingIEEE Transactions on Mobile Computing10.1109/TMC.2022.323221523:2(1066-1079)Online publication date: 1-Feb-2024
          • (2024)Data-Driven Pick-Up Location Recommendation for Ride-Hailing ServicesIEEE Transactions on Mobile Computing10.1109/TMC.2022.320856623:2(1001-1015)Online publication date: 1-Feb-2024
          • (2024)Fast and Scalable Ridesharing SearchIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.341843336:11(6159-6170)Online publication date: 1-Nov-2024
          • (2024)Spatial–Temporal Upfront Pricing Under a Mixed Pooling and Non-Pooling Market With Reinforcement LearningIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2024.341450425:11(17628-17649)Online publication date: 1-Nov-2024
          • (2024)D-SPAC: Double-Sided Preference-Aware Carpooling of Private Cars for Maximizing Passenger UtilityIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2024.335354525:8(9810-9827)Online publication date: 1-Aug-2024
          • (2024)Offline policy reuse-guided anytime online collective multiagent planning and its application to mobility-on-demand systemsAutonomous Agents and Multi-Agent Systems10.1007/s10458-024-09650-z38:1Online publication date: 1-Jun-2024
          • (2024)A two-stage dispatching approach for one-to-many ride-sharing with sliding time windowsNeural Computing and Applications10.1007/s00521-024-09631-z36:19(11213-11239)Online publication date: 1-Jul-2024
          • (2023)Using simple incentives to improve two-sided fairness in ridesharing systemsProceedings of the Thirty-Third International Conference on Automated Planning and Scheduling10.1609/icaps.v33i1.27199(227-235)Online publication date: 8-Jul-2023
          • Show More Cited By

          View Options

          View options

          Media

          Figures

          Other

          Tables

          Share

          Share

          Share this Publication link

          Share on social media