Document Open Access Logo

The Line-Based Dial-a-Ride Problem with Transfers

Authors Jonas Barth , Kendra Reiter , Marie Schmidt

PDF

File

Thumbnail PDF
PDF
OASIcs.ATMOS.2025.17.pdf
  • Filesize: 1.21 MB
  • 20 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Applied computing → Transportation
Keywords
  • dial-a-ride
  • line-based
  • transfers
  • on-demand
  • ridepooling

Metrics

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

Abstract

We introduce the line-based dial-a-ride problem with transfers (liDARPT), a variation of the well-studied dial-a-ride problem (DARP), where vehicles transport requests on-demand but are constrained to operate along a set of lines, and passengers are allowed to transfer between lines on their journey. We develop an event-based solution approach for the liDARPT that relies on the construction of an event-based graph and uses a MILP to find optimal circulations in the event-based graph. To make this solution approach effective, we devise a pre-processing routine to limit the size of the event-based graph. We extensively test our approach on novel benchmark instances, inspired by real-life long-distance bus networks. In our experiments, problem instances with up to 80 requests can be solved to optimality within 15 minutes, and an average of 99.69% of requests are accepted in all instances solved to optimality.

Cite As Get BibTex

Jonas Barth, Kendra Reiter, and Marie Schmidt. The Line-Based Dial-a-Ride Problem with Transfers. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 17:1-17:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/OASIcs.ATMOS.2025.17

Author Details

Jonas Barth
  • Department of Computer Science, University of Würzburg, Germany
Kendra Reiter
  • Department of Computer Science, University of Würzburg, Germany
Marie Schmidt
  • Department of Computer Science, University of Würzburg, Germany

Supplementary Materials

References

  1. 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: https://doi.org/10.1073/pnas.1611675114.
  2. Andrea Attanasio, Jean-François Cordeau, Gianpaolo Ghiani, and Gilbert Laporte. Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing, 30(3):377-387, March 2004. URL: https://doi.org/10.1016/j.parco.2003.12.001.
  3. Jonas Barth. liDARPT. Software, (visited on 2025-08-27). URL: https://github.com/barjon0/liDARPT
    Software Heritage Logo archived version
    full metadata available at: https://doi.org/10.4230/artifacts.24588
  4. Jonas Barth. The line-based dial-a-ride problem with transfers. Master’s thesis, Julius-Maximilians-Universität Würzburg, Germany, 2025. Google Scholar
  5. John W. Baugh, Gopala Krishna Reddy Kakivaza, and John R. Stone. Intractability of the Dial-a-Ride Problem and a Multiobjective Solution Using Simulated Annealing. Engineering Optimization, 30(2):91-123, February 1998. URL: https://doi.org/10.1080/03052159808941240.
  6. Gerardo Berbeglia, Jean-François Cordeau, and Gilbert Laporte. A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem. INFORMS Journal on Computing, 24(3):343-355, 2012. URL: https://doi.org/10.1287/IJOC.1110.0454.
  7. 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.
  8. Jean-François Cordeau and Gilbert Laporte. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37(6):579-594, 2003. URL: https://doi.org/10.1016/S0191-2615(02)00045-0.
  9. Jean-François Cordeau and Gilbert Laporte. The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 1(2):89-101, June 2003. URL: https://doi.org/10.1007/s10288-002-0009-8.
  10. Samuel Deleplanque and Alain Quilliot. Dial-a-ride problem with time windows, transshipments, and dynamic transfer points. IFAC Proceedings Volumes, 46(9):1256-1261, 2013. 7th IFAC Conference on Manufacturing Modelling, Management, and Control. URL: https://doi.org/10.3182/20130619-3-RU-3018.00435.
  11. Daniela Gaul, Kathrin Klamroth, Christian Pfeiffer, Michael Stiglmayr, and Arne Schulz. A tight formulation for the dial-a-ride problem. European Journal of Operational Research, 321(2):363-382, 2024. URL: https://doi.org/10.1016/j.ejor.2024.09.028.
  12. Daniela Gaul, Kathrin Klamroth, and Michael Stiglmayr. Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph. In DROPS-IDN/v2/document/10.4230/OASIcs.ATMOS.2021.8. Schloss-Dagstuhl - Leibniz Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/OASIcs.ATMOS.2021.8.
  13. Daniela Gaul, Kathrin Klamroth, and Michael Stiglmayr. Event-based MILP models for ridepooling applications. European Journal of Operational Research, 301(3):1048-1063, September 2022. URL: https://doi.org/10.1016/j.ejor.2021.11.053.
  14. Konstantinos Gkiotsalitis and A Nikolopoulou. The multi-vehicle dial-a-ride problem with interchange and perceived passenger travel times. Transportation research part C: emerging technologies, 156:104353, 2023. URL: https://doi.org/10.1016/j.trc.2023.104353.
  15. Timo Gschwind and Stefan Irnich. Effective handling of dynamic time windows and its application to solving the dial-a-ride problem. Transportation Science, 49(2):335-354, 2015. URL: https://doi.org/10.1287/trsc.2014.0531.
  16. 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.
  17. Ailing Huang, Ziqi Dou, Liuzi Qi, and Lewen Wang. Flexible Route Optimization for Demand-Responsive Public Transit Service. Journal of Transportation Engineering Part A Systems, 146, September 2020. URL: https://doi.org/10.1061/JTEPBS.0000448.
  18. Antonio Lauerbach, Kendra Reiter, and Marie Schmidt. The complexity of counting turns in the line-based dial-a-ride problem. In International Conference on Current Trends in Theory and Practice of Computer Science, pages 85-98. Springer, 2025. URL: https://doi.org/10.1007/978-3-031-82697-9_7.
  19. Christian Liebchen, Martin Lehnert, Christian Mehlert, and Martin Schiefelbusch. Betriebliche Effizienzgrößen für Ridepooling-Systeme, pages 135-150. Springer Fachmedien Wiesbaden, Wiesbaden, 2021. URL: https://doi.org/10.1007/978-3-658-32266-3_7.
  20. Renaud Masson, Fabien Lehuédé, and Olivier Péton. The dial-a-ride problem with transfers. Computers & Operations Research, 41:12-23, 2014. URL: https://doi.org/10.1016/j.cor.2013.07.020.
  21. Yves Molenbruch, Kris Braekers, and An Caris. Typology and literature review for dial-a-ride problems. Annals of Operations Research, 259(1):295-325, December 2017. URL: https://doi.org/10.1007/s10479-017-2525-0.
  22. Sophie N. Parragh, Jean-François Cordeau, Karl F. Doerner, and Richard F. Hartl. Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints. OR Spectrum, 34(3):593-633, 2012. URL: https://doi.org/10.1007/s00291-010-0229-9.
  23. Sophie N. Parragh and Verena Schmid. Hybrid column generation and large neighborhood search for the dial-a-ride problem. Computers & Operations Research, 40(1):490-497, 2013. URL: https://doi.org/10.1016/j.cor.2012.08.004.
  24. Christian Pfeiffer and Arne Schulz. An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization. OR Spectrum, 44(1):87-119, 2022. URL: https://doi.org/10.1007/s00291-021-00656-7.
  25. Line Blander Reinhardt, Tommy Clausen, and David Pisinger. Synchronized dial-a-ride transportation of disabled passengers at airports. European Journal of Operational Research, 225(1):106-117, February 2013. URL: https://doi.org/10.1016/j.ejor.2012.09.008.
  26. Kendra Reiter, Marie Schmidt, and Michael Stiglmayr. The line-based dial-a-ride problem. In 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, 2024. URL: https://doi.org/10.4230/OASIcs.ATMOS.2024.14.
  27. Yannik Rist and Michael A. Forbes. A new formulation for the dial-a-ride problem. Transportation Science, 55(5):1113-1135, 2021. URL: https://doi.org/10.1287/trsc.2021.1044.
  28. Stefan Ropke, Jean-François Cordeau, and Gilbert Laporte. Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks, 49(4):258-272, 2007. URL: https://doi.org/10.1002/net.20177.
  29. Stefan Ropke and David Pisinger. An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows. Transportation Science, 40(4):455-472, 2006. URL: https://doi.org/10.1287/trsc.1050.0135.
  30. Jörn Schönberger. Scheduling constraints in dial-a-ride problems with transfers: a metaheuristic approach incorporating a cross-route scheduling procedure with postponement opportunities. Public Transport, 9:243-272, 2017. URL: https://doi.org/10.1007/s12469-016-0139-6.
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