Bilong Shen
Abstract
Ridesharing, which offers empty seats in a car to other passengers, is an efficient way of transportation. In this way, the utilization of seats can be improved and the number of cars used can be reduced. Ridesharing has the potential to solve the problems of congestion, pollution, high travel cost, and energy. The development of internet, smart phone, GPS allows dynamic matchings of travel requests with available cars through real-time travel planning systems. However, matching requests and cars under certain constrains in large scale remains challenging. In this paper, we formally address the problem of dynamic ridesharing and introduce the solution framework of filter and refine, under which we summarize existing state-of-the-art works. Finally, we point out possible research directions and problems needed to be solved.
- N. A. Agatz, A. L. Erera, M. W. Savelsbergh, and X. Wang. Dynamic ride-sharing: A simulation study in metro atlanta. Transportation Research Part B: Methodological, 45(9):1450--1464, 2011.Google Scholar
Cross Ref
- V. Armant and K. N. Brown. Minimizing the driving distance in ride sharing systems. In Tools with Artificial Intelligence (ICTAI), 2014 IEEE 26th International Conference on, pages 568--575. IEEE, 2014. Google ScholarDigital Library
- A. Attanasio, J.-F. Cordeau, G. Ghiani, and G. Laporte. Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing, 30(3):377--387, 2004. Google ScholarDigital Library
- N. D. Chan and S. A. Shaheen. Ridesharing in north america: Past, present, and future. Transport Reviews, 32(1):93--112, 2012.Google ScholarCross Ref
- B. Cici, A. Markopoulou, E. Frías-Martínez, and N. Laoutaris. Quantifying the potential of ride-sharing using call description records. In Proceedings of the 14th Workshop on Mobile Computing Systems and Applications, page 17. ACM, 2013. Google ScholarDigital Library
- J.-F. Cordeau. A branch-and-cut algorithm for the dial-a-ride problem. Operations Research, 54(3):573--586, 2006. Google ScholarDigital Library
- L. Coslovich, R. Pesenti, and W. Ukovich. A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. European Journal of Operational Research, 175(3):1605--1615, 2006.Google ScholarCross Ref
- P. M. d'Orey, R. Fernandes, and M. Ferreira. Empirical evaluation of a dynamic and distributed taxi-sharing system. In Intelligent Transportation Systems (ITSC), 2012 15th International IEEE Conference on, pages 140--146. IEEE, 2012.Google ScholarCross Ref
- M. Furuhata, M. Dessouky, F. Ordez, M.-E. Brunet, X. Wang, and S. Koenig. Ridesharing: The state-of-the-art and future directions. Transportation Research Part B: Methodological, 57:28--46, 2013.Google ScholarCross Ref
- K. Ghoseiri, A. E. Haghani, M. Hamedi, and M.-A. U. T. Center. Real-time rideshare matching problem. Mid-Atlantic Universities Transportation Center, 2011.Google Scholar
- G. Gidofalvi, T. B. Pedersen, T. Risch, and E. Zeitler. Highly scalable trip grouping for large-scale collective transportation systems. In Proceedings of the 11th international conference on Extending database technology: Advances in database technology, pages 678--689. ACM, 2008. Google ScholarDigital Library
- Y. Huang, F. Bastani, R. Jin, and X. S. Wang. Large scale real-time ridesharing with service guarantee on road networks. Proceedings of the VLDB Endowment, 7(14):2017--2028, 2014. Google ScholarDigital Library
- B. Kalantari, A. V. Hill, and S. R. Arora. An algorithm for the traveling salesman problem with pickup and delivery customers. European Journal of Operational Research, 22(3):377--386, 1985.Google ScholarCross Ref
- E. Kamar and E. Horvitz. Collaboration and shared plans in the open world: Studies of ridesharing. In IJCAI, volume 9, page 187, 2009. Google ScholarDigital Library
- A. Kleiner, B. Nebel, and V. Ziparo. A mechanism for dynamic ride sharing based on parallel auctions. 2011.Google Scholar
- B. Li, D. Krushinsky, H. A. Reijers, and T. Van Woensel. The share-a-ride problem: People and parcels sharing taxis. European Journal of Operational Research, 238(1):31--40, 2014.Google ScholarCross Ref
- S. Ma, Y. Zheng, and O. Wolfson. T-share: A large-scale dynamic taxi ridesharing service. In Data Engineering (ICDE), 2013 IEEE 29th International Conference on, pages 410--421. IEEE, 2013. Google ScholarDigital Library
- K. Radke, M. Brereton, S. Mirisaee, S. Ghelawat, C. Boyd, and J. G. Nieto. Tensions in developing a secure collective information practice-the case of agile ridesharing. In Human-Computer Interaction--INTERACT 2011, pages 524--532. Springer, 2011. Google ScholarDigital Library
- M. W. Savelsbergh. Local search in routing problems with time windows. Annals of Operations research, 4(1):285--305, 1985.Google ScholarCross Ref
- C. Tian, Y. Huang, Z. Liu, F. Bastani, and R. Jin. Noah: a dynamic ridesharing system. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pages 985--988. ACM, 2013. Google ScholarDigital Library
- J. Witkowski, S. Seuken, and D. C. Parkes. Incentive-compatible escrow mechanisms. In AAAI, 2011.Google Scholar
- X. Xing, T. Warden, T. Nicolai, and O. Herzog. Smize: a spontaneous ride-sharing system for individual urban transit. In Multiagent System Technologies, pages 165--176. Springer, 2009. Google ScholarDigital Library
- D. Zhao, D. Zhang, E. H. Gerding, Y. Sakurai, and M. Yokoo. Incentives in ridesharing with deficit control. In Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, pages 1021--1028. International Foundation for Autonomous Agents and Multiagent Systems, 2014. Google ScholarDigital Library
Recommendations
Utility-Aware Ridesharing on Road Networks
SIGMOD '17: Proceedings of the 2017 ACM International Conference on Management of DataRidesharing enables drivers to share any empty seats in their vehicles with riders to improve the efficiency of transportation for the benefit of both drivers and riders. Different from existing studies in ridesharing that focus on minimizing the travel ...
Dynamic taxi and ridesharing: a framework and heuristics for the optimization problem
IJCAI '13: Proceedings of the Twenty-Third international joint conference on Artificial IntelligenceIn this paper we study a dynamic problem of ridesharing and taxi sharing with time windows. We consider a scenario where people needing a taxi or interested in getting a ride use a phone app to designate their source and destination points in a city, as ...
Real-Time City-Scale Taxi Ridesharing
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 ...
Comments