Multimodal Transportation with Ridesharing of Personal Vehicles

Authors Qian-Ping Gu, JiaJian Liang

Thumbnail PDF


  • Filesize: 6.49 MB
  • 16 pages

Document Identifiers

Author Details

Qian-Ping Gu
  • School of Computing Science, Simon Fraser University, Burnaby, Canada
JiaJian Liang
  • School of Computing Science, Simon Fraser University, Burnaby, Canada


The authors thank anonymous reviewers for their constructive comments.

Cite AsGet BibTex

Qian-Ping Gu and JiaJian Liang. Multimodal Transportation with Ridesharing of Personal Vehicles. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 39:1-39:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)


Many public transportation systems are unable to keep up with growing passenger demand as the population grows in urban areas. The slow or lack of improvement for public transportation pushes people to use private transportation modes, such as carpooling and ridesharing. However, the occupancy rate of personal vehicles has been dropping in many cities. In this paper, we describe a centralized transit system that integrates public transit and ridesharing, which matches drivers and transit riders such that the riders would result in shorter travel time using both transit and ridesharing. The optimization goal of the system is to assign as many riders to drivers as possible for ridesharing. We give an exact approach and approximation algorithms to achieve the optimization goal. As a case study, we conduct an extensive computational study to show the effectiveness of the transit system for different approximation algorithms, based on the real-world traffic data in Chicago City; the data sets include both public transit and ridesharing trip information. The experiment results show that our system is able to assign more than 60% of riders to drivers, leading to a substantial increase in occupancy rate of personal vehicles and reducing riders' travel time.

Subject Classification

ACM Subject Classification
  • Theory of computation → Approximation algorithms analysis
  • Applied computing → Transportation
  • Multimodal transportation
  • ridesharing
  • approximation algorithms
  • computational study


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Niels Agatz, Alan Erera, Martin Savelsbergh, and Xing Wang. Dynamic ride-sharing: A simulation study in metro atlanta. Transportation Research Part B: Methodological, 45(9):1450-1464, 2011. URL:
  2. Niels Agatz, Alan Erera, Martin Savelsbergh, and Xing Wang. Optimization for dynamic ride-sharing: A review. European Journal of Operational Research, 223(2):295-303, 2012. URL:
  3. Kamel Aissat and Sacha Varone. Carpooling as complement to multi-modal transportation. In Enterprise Information Systems, pages 236-255, January 2015. URL:
  4. Javier Alonso-Mora, Samitha Samaranayake, Alex Wallar, Emilio Frazzoli, and Daniela Rus. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proceedings of the National Academy of Sciences, 114(3):462-467, 2017. URL:
  5. Piotr Berman. A d/2 approximation for maximum weight independent set in d-claw free graphs. In Algorithm Theory - SWAT 2000, pages 214-219. Springer Berlin Heidelberg, 2000. URL:
  6. Center for Sustainable Systems, University of Michigan. Personal transportation factsheet, 2020. URL:
  7. Barun Chandra and Magnús M Halldórsson. Greedy local improvement and weighted set packing approximation. Journal of Algorithms, 39(2):223-240, 2001. URL:
  8. Chicago Transit Authority. System-wide rail capacity study. Published June 2017; Revised February 2019. URL:
  9. Sharon Feigon and Colin Murphy. Shared mobility and the transformation of public transit. TCRP Research Report, Transportation Research Board, 2016. URL:
  10. Masabumi Furuhata, Maged Dessouky, Fernando Ordóñez, Marc-Etienne Brunet, Xiaoqing Wang, and Sven Koenig. Ridesharing: The state-of-the-art and future directions. Transportation Research Part B: Methodological, 57:28-46, 2013. URL:
  11. Michael R. Garey and David S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, 1979. Google Scholar
  12. Keivan Ghoseiri, Ali Haghani, and Masoud Hamedi. Real-time rideshare matching problem. Final Report of UMD-2009-05, U.S. Department of Transportation, 2011. Google Scholar
  13. Qian-Ping Gu and Jiajian Leo Liang. Multimodal transportation with ridesharing of personal vehicles, 2021. URL:
  14. Qian-Ping Gu, Jiajian Leo Liang, and Guochuan Zhang. Approximate ridesharing of personal vehicles problem. Theoretical Computer Science, 871:30-50, 2021. URL:
  15. Elad Hazan, Shmuel Safra, and Oded Schwartz. On the complexity of approximating k-set packing. Computational Complexity, 15(1):20-39, 2006. URL:
  16. John Hopcroft and Richard Karp. An n^5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225-231, 1973. URL:
  17. Haosheng Huang, Dominik Bucher, Julian Kissling, Robert Weibel, and Martin Raubal. Multimodal route planning with public transport and carpooling. IEEE Transactions on Intelligent Transportation Systems, 20(9):3513-3525, 2019. URL:
  18. Richard M. Karp. Reducibility among combinatorial problems, pages 85-103. Springer US, Boston, MA, 1972. URL:
  19. Tai-Yu Ma. On-demand dynamic bi-/multi-modal ride-sharing using optimal passenger-vehicle assignments. In 2017 IEEE International Conference on Environment and Electrical Engineering and 2017 IEEE Industrial and Commercial Power Systems Europe (EEEIC / I CPS Europe), pages 1-5, 2017. URL:
  20. Tai-Yu Ma, Saeid Rasulkhani, Joseph Y.J. Chow, and Sylvain Klein. A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers. Transportation Research Part E: Logistics and Transportation Review, 128:417-442, 2019. URL:
  21. Abood Mourad, Jakob Puchinger, and Chengbin Chu. A survey of models and algorithms for optimizing shared mobility. Transportation Research Part B: Methodological, 123:323-346, 2019. URL:
  22. Arvind U Raghunathan, David Bergman, John Hooker, Thiago Serra, and Shingo Kobori. Seamless multimodal transportation scheduling, 2018. URL:
  23. Paolo Santi, Giovanni Resta, Michael Szell, Stanislav Sobolevsky, Steven H. Strogatz, and Carlo Ratti. Quantifying the benefits of vehicle pooling with shareability networks. Proceedings of the National Academy of Sciences, 111(37):13290-13294, 2014. URL:
  24. A. Santos, N. McGuckin, H.Y. Nakamoto, D. Gray, and S. Liss. Summary of travel trends: 2009 national household travel survey. Technical report, US Department of Transportation Federal Highway Administration, 2011. Google Scholar
  25. Mitja Stiglic, Niels Agatz, Martin Savelsbergh, and Mirko Gradisar. The benefits of meeting points in ride-sharing systems. Transportation Research Part B: Methodological, 82:36-53, 2015. URL:
  26. Mitja Stiglic, Niels Agatz, Martin Savelsbergh, and Mirko Gradisar. Enhancing urban mobility: Integrating ride-sharing and public transit. Computers & Operations Research, 90:12-21, 2018. URL:
  27. Amirmahdi Tafreshian, Neda Masoud, and Yafeng Yin. Frontiers in service science: Ride matching for reer-to-reer ride sharing: A review and future directions. Service Science, 12(2-3):41-60, 2020. URL:
  28. Hai Wang and Amedeo Odoni. Approximating the performance of a "last mile" transportation system. Transportation Science, 50(2):659-675, 2014. URL:
  29. Zhengtian Xu, Yafeng Yin, and Jieping Ye. On the supply curve of ride-hailing systems. Transportation Research Part B: Methodological, 132:29-43, 2020. 23rd International Symposium on Transportation and Traffic Theory (ISTTT 23). URL: