Document Open Access Logo

Exact and Heuristic Dynamic Taxi Sharing with Transfers Using Shortest-Path Speedup Techniques

Authors Johannes Breitling , Moritz Laupichler

PDF

File

Thumbnail PDF
PDF
OASIcs.ATMOS.2025.15.pdf
  • Filesize: 5.47 MB
  • 22 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Applied computing → Transportation
  • Theory of computation → Shortest paths
  • Information systems → Geographic information systems
Keywords
  • Dynamic taxi sharing
  • ride pooling
  • dial-a-ride problem
  • transfers
  • route planning

Metrics

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

Abstract

We introduce a first-of-its-kind efficient, exact algorithm for the dynamic taxi-sharing problem with single-transfer journeys, i.e., a dispatcher that assigns traveler requests to a fleet of shared taxi-like vehicles allowing transfers between vehicles. We extend an existing no-transfer solution by collecting all viable pickup and dropoff vehicles for a request and computing the optimal transfer point for every pair of vehicles. We analyze underlying shortest-path problems and employ state-of-the-art routing algorithms to compute distances on-the-fly, which serves as the basis of dispatching requests with exact and up-to-date travel time information. We utilize constraints on existing routes, pruning techniques for transfer points, and both instruction- and thread-level parallelism to speed up the computation of the best assignment for every traveler. In addition to the exact variant, we propose a tunable heuristic approach that sacrifices solution quality in favor of improved running time.
We evaluate our algorithm on a large road network with realistic input sets (up to 150000 requests). We demonstrate the effectiveness of our speedup techniques and the heuristic. We show first results on the benefits of transfers for taxi sharing on dense request sets, proving that our algorithm is well suited for the analysis of taxi sharing with transfers on large input instances.

Cite As Get BibTex

Johannes Breitling and Moritz Laupichler. Exact and Heuristic Dynamic Taxi Sharing with Transfers Using Shortest-Path Speedup Techniques. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 15:1-15:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/OASIcs.ATMOS.2025.15

Author Details

Johannes Breitling
  • Karlsruhe Institute of Technology, Germany
Moritz Laupichler
  • Karlsruhe Institute of Technology, Germany

Funding

This paper was created in the "Country 2 City - Bridge" project of the "German Center for Future Mobility", which is funded by the German Federal Ministry of Transport.
  • Laupichler, Moritz: This work was supported by funding from the pilot program Core Informatics of the Helmholtz Association (HGF).

Supplementary Materials

References

  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:1450-1464, 2011. URL: https://doi.org/10.1016/j.trb.2011.05.017.
  2. 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 of the United States of America, 114:462-467, 2017. URL: https://doi.org/10.1073/pnas.1611675114.
  3. Claudine Badue, Rânik Guidolini, Raphael Vivacqua Carneiro, Pedro Azevedo, Vinicius B. Cardoso, Avelino Forechi, Luan F. R. Jesus, Rodrigo Ferreira Berriel, Thiago M. Paixão, Filipe Wall Mutz, Lucas de Paula Veronese, Thiago Oliveira-Santos, and Alberto F. De Souza. Self-driving cars: A survey. Expert Systems with Applications, 165, 2021. URL: https://doi.org/10.1016/j.eswa.2020.113816.
  4. Joschka Bischoff, Michal Maciejewski, and Kai Nagel. City-wide shared taxis: A simulation study in berlin. In 20th IEEE International Conference on Intelligent Transportation Systems, ITSC 2017, Yokohama, Japan, October 16-19, 2017, pages 275-280. IEEE, 2017. URL: https://doi.org/10.1109/ITSC.2017.8317926.
  5. Thomas Bläsius, Valentin Buchhold, Dorothea Wagner, Tim Zeitz, and Michael Zündorf. Customizable contraction hierarchies - A survey. CoRR, 2025. URL: https://doi.org/10.48550/arXiv.2502.10519.
  6. Johannes Breitling and Moritz Laupichler. karri-with-transfers. Software, (visited on 2025-08-27). URL: https://github.com/JohannesBreitling/karri-with-transfers
    Software Heritage Logo archived version
    full metadata available at: https://doi.org/10.4230/artifacts.24437
  7. Valentin Buchhold, Peter Sanders, and Dorothea Wagner. Fast, exact and scalable dynamic ridesharing. In Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX, pages 98-112. SIAM, 2021. URL: https://doi.org/10.1137/1.9781611976472.8.
  8. Brian Coltin. Multi-Agent Pickup And Delivery Planning With Transfers. PhD thesis, Carnegie Mellon University, USA, 2014. URL: https://doi.org/10.1184/R1/6720740.v1.
  9. Jean-François Cordeau. A branch-and-cut algorithm for the dial-a-ride problem. Operations Research, 54(3):573-586, 2006. URL: https://doi.org/10.1287/opre.1060.0283.
  10. Jean François Cordeau and Gilbert Laporte. The dial-a-ride problem: Models and algorithms. Annals of Operations Research, 153(1):29-46, 2007. URL: https://doi.org/10.1007/s10479-007-0170-8.
  11. Daniel Delling, Andrew V. Goldberg, Andreas Nowatzyk, and Renato F. Werneck. PHAST: Hardware-accelerated shortest path trees. Journal of Parallel and Distributed Computing, 73(7):940-952, 2013. URL: https://doi.org/10.1016/j.jpdc.2012.02.007.
  12. Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. Faster batched shortest paths in road networks. In 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS), volume 20 of OASIcs, pages 52-63. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2011. URL: https://doi.org/10.4230/OASIcs.ATMOS.2011.52.
  13. Julian Dibbelt, Ben Strasser, and Dorothea Wagner. Customizable contraction hierarchies. Journal of Experimental Algorithmics, 21(1):1.5:1-1.5:49, 2016. URL: https://doi.org/10.1145/2886843.
  14. Edsger W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959. URL: https://doi.org/10.1007/BF01386390.
  15. Fábio Duarte and Carlo Ratti. The impact of autonomous vehicles on cities: A review. Journal of Urban Technology, 25:3-18, 2018. URL: https://doi.org/10.1080/10630732.2018.1493883.
  16. Daniel J. Fagnant and Kara M. Kockelman. The travel and environmental implications of shared autonomous vehicles, using agent-based model scenarios. Transportation Research Part C: Emerging Technologies, 40:1-13, 2014. URL: https://doi.org/10.1016/j.trc.2013.12.001.
  17. Daniel J. Fagnant and Kara M. Kockelman. Dynamic ride-sharing and fleet sizing for a system of shared autonomous vehicles in Austin, Texas. Transportation, 45:143-158, 2018. URL: https://doi.org/10.1007/s11116-016-9729-z.
  18. Eleonora Gargiulo, Roberta Giannantonio, Elena Guercio, Claudio Borean, and Giovanni Zenezini. Dynamic ride sharing service: Are users ready to adopt it? Procedia Manufacturing, 3:777-784, 2015. URL: https://doi.org/10.1016/j.promfg.2015.07.329.
  19. Robert Geisberger, Peter Sanders, Dominik Schultes, and Christian Vetter. Exact routing in large road networks using contraction hierarchies. Transportation Science, 46(3):388-404, 2012. URL: https://doi.org/10.1287/trsc.1110.0401.
  20. Mireia Gilibert, Imma Ribas, Christian Rosen, and Alexander Siebeneich. On-demand shared ride-hailing for commuting purposes: Comparison of Barcelona and Hannover case studies. In Transportation Research Procedia, volume 47, pages 323-330. Elsevier, 2020. URL: https://doi.org/10.1016/j.trpro.2020.03.105.
  21. Sin C. Ho, W.Y. Szeto, Yong-Hong Kuo, Janny M.Y. Leung, Matthew Petering, and Terence W.H. Tou. A survey of dial-a-ride problems: Literature review and recent developments. Transportation Research Part B: Methodological, 111:395-421, 2018. URL: https://doi.org/10.1016/j.trb.2018.02.001.
  22. Andreas Horni, Kai Nagel, and Kay W. Axhausen, editors. The Multi-Agent Transport Simulation MATSim. Ubiquity Press, 2016. URL: https://doi.org/10.5334/baw.
  23. Yunfei Hou, Weida Zhong, Lu Su, Kevin F. Hulme, Adel W. Sadek, and Chunming Qiao. Taset: Improving the efficiency of electric taxis with transfer-allowed rideshare. Trans. Veh. Technol., 65(12):9518-9528, 2016. URL: https://doi.org/10.1109/TVT.2016.2592983.
  24. Jang-Jei Jaw, Amedeo R. Odoni, Harilaos N. Psaraftis, and Nigel H.M. Wilson. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research Part B: Methodological, 20(3):243-257, 1986. URL: https://doi.org/10.1016/0191-2615(86)90020-2.
  25. Jani-Pekka Jokinen, Teemu Sihvola, and Milos N. Mladenovic. Policy lessons from the flexible transport service pilot Kutsuplus in the Helsinki capital region. Transport Policy, 76:123-133, 2019. URL: https://doi.org/10.1016/j.tranpol.2017.12.004.
  26. Jaeyoung Jung, R. Jayakrishnan, and Ji Young Park. Dynamic shared-taxi dispatch algorithm with hybrid-simulated annealing. Computer-Aided Civil and Infrastructure Engineering, 31(4):275-291, 2016. URL: https://doi.org/10.1111/mice.12157.
  27. Sebastian Knopp, Peter Sanders, Dominik Schultes, Frank Schulz, and Dorothea Wagner. Computing many-to-many shortest paths using highway hierarchies. In Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, 2007. URL: https://doi.org/10.1137/1.9781611972870.4.
  28. Nadine Kostorz, Eva Fraedrich, and Martin Kagerbauer. Usage and user characteristics—insights from MOIA, europe’s largest ridepooling service. Sustainability, 13:958, 2021. URL: https://doi.org/10.3390/su13020958.
  29. Nico Kuehnel, Hannes Rewald, Steffen Axer, Felix Zwick, and Rolf Findeisen. Flow-inflated selective sampling for efficient agent-based dynamic ride-pooling simulations. Transportation Research Record: Journal of the Transportation Research Board, page 036119812311706, 2023. URL: https://doi.org/10.1177/03611981231170624.
  30. Moritz Laupichler and Peter Sanders. Fast many-to-many routing for dynamic taxi sharing with meeting points. CoRR, 2023. URL: https://doi.org/10.48550/arXiv.2311.01581.
  31. Moritz Laupichler and Peter Sanders. Fast many-to-many routing for dynamic taxi sharing with meeting points. In 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), pages 74-90. SIAM, 2024. URL: https://doi.org/10.1137/1.9781611977929.6.
  32. Yeqian Lin, Wenquan Li, Feng Qiu, and He Xu. Research on optimization of vehicle routing problem for ride-sharing taxi. Procedia - Social and Behavioral Sciences, 43:494-502, 2012. URL: https://doi.org/10.1016/j.sbspro.2012.04.122.
  33. Shuo Ma, Yu Zheng, and Ouri Wolfson. T-Share: A large-scale dynamic taxi ridesharing service. In IEEE 29th International Conference on Data Engineering (ICDE), pages 410-421. IEEE, 2013. URL: https://doi.org/10.1109/ICDE.2013.6544843.
  34. Ulrich Meyer and Peter Sanders. δ-stepping: a parallelizable shortest path algorithm. Journal of Algorithms, 49(1):114-152, 2003. 1998 European Symposium on Algorithms. URL: https://doi.org/10.1016/S0196-6774(03)00076-2.
  35. Dimitris Milakis, Bart van Arem, and Bert van Wee. Policy and society related implications of automated driving: A review of literature and directions for future research. Journal of Intelligent Transportation Systems, 21(4):324-348, 2017. URL: https://doi.org/10.1080/15472450.2017.1291351.
  36. Motahare Mounesan, Vindula Jayawardana, Yaocheng Wu, Samitha Samaranayake, and Huy T. Vo. Fleet management for ride-pooling with meeting points at scale: A case study in the five boroughs of New York City. CoRR, 2021. URL: https://doi.org/10.48550/arXiv.2105.00994.
  37. Douglas O. Santos and Eduardo C. Xavier. Taxi and ride sharing: A dynamic dial-a-ride problem with money as an incentive. Expert Systems with Applications, 42(19):6728-6737, 2015. URL: https://doi.org/10.1016/j.eswa.2015.04.060.
  38. Martin Savelsbergh. Local search in routing problems with time windows. Annals of Operations Research, 4:285-305, 1985. URL: https://doi.org/10.1007/BF02022044.
  39. Michael Schilde, Karl F. Doerner, and Richard F. Hartl. Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Computers and Operations Research, 38(12):1719-1730, 2011. URL: https://doi.org/10.1016/j.cor.2011.02.006.
  40. Changle Song, Julien Monteil, Jean-Luc Ygnace, and David Rey. Incentives for ridesharing: A case study of welfare and traffic congestion. Journal of Advanced Transportation, 2021. URL: https://doi.org/10.1155/2021/6627660.
  41. Chichung Tao and Chungjung Wu. Behavioral responses to dynamic ridesharing services - the case of taxi-sharing project in Taipei. In International Conference on Service Operations and Logistics, and Informatics, pages 1576-1581. IEEE, 2008. URL: https://doi.org/10.1109/SOLI.2008.4682777.
  42. Dujuan Wang, Qi Wang, Yunqiang Yin, and T.C.E. Cheng. Optimization of ride-sharing with passenger transfer via deep reinforcement learning. Transportation Research Part E: Logistics and Transportation Review, 172:103080, 2023. URL: https://doi.org/10.1016/j.tre.2023.103080.
  43. Christoffer Weckström, Miloš N. Mladenović, Waqar Ullah, John D. Nelson, Moshe Givoni, and Sebastian Bussman. User perspectives on emerging mobility services: Ex post analysis of Kutsuplus pilot. Research in Transportation Business & Management, 27:84-97, 2018. URL: https://doi.org/10.1016/j.rtbm.2018.06.003.
  44. Gabriel Wilkes, Roman Engelhardt, Lars Briem, Florian Dandl, Peter Vortisch, Klaus Bogenberger, and Martin Kagerbauer. Self-regulating demand and supply equilibrium in joint simulation of travel demand and a ride-pooling service. Transportation Research Record: Journal of the Transportation Research Board, 2675:226-239, 2021. URL: https://doi.org/10.1177/0361198121997140.
  45. Max Willich. Improving vehicle detour in dynamic ridesharing using transfer stops. Master’s thesis, Karlsruher Institut für Technologie (KIT), 2023. URL: https://doi.org/10.5445/IR/1000165197.
  46. Biying Yu, Ye Ma, Meimei Xue, Baojun Tang, Bin Wang, Jinyue Yan, and Yi-Ming Wei. Environmental benefits from ridesharing: A case of Beijing. Applied Energy, 191:141-152, 2017. URL: https://doi.org/10.1016/j.apenergy.2017.01.052.
  47. Dianzhuo Zhu. The limits of money in daily ridesharing: Evidence from a field experiment in rural France. Revue d'économie industrielle, pages 161-202, 2021. URL: https://doi.org/10.4000/rei.9984.
  48. Dominik Ziemke, Ihab Kaddoura, and Kai Nagel. The MATSim Open Berlin scenario: A multimodal agent-based transport simulation scenario based on synthetic demand modeling and open data. In 8th International Workshop on Agent-based Mobility, Traffic and Transportation Models, April 29 - May 2, 2019, Leuven, Belgium, volume 151 of Procedia Computer Science, pages 870-877. Elsevier, 2019. URL: https://doi.org/10.1016/j.procs.2019.04.120.
  49. Felix Zwick, Gabriel Wilkes, Roman Engelhardt, Steffen Axer, Florian Dandl, Hannes Rewald, Nadine Kostorz, Eva Fraedrich, Martin Kagerbauer, and Kay W. Axhausen. Mode choice and ride-pooling simulation: A comparison of mobiTopp, Fleetpy, and MATSim. In 11th International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies and Applications (ABMTRANS), March 22-25, 2022, Porto, Portugal, volume 201 of Procedia Computer Science, pages 608-613. Elsevier, 2022. URL: https://doi.org/10.1016/j.procs.2022.03.079.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact