2026-07-23T20:12:17Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:24773 2026-02-09T07:38:06Z ddc:004 open_access

The Line-Based Dial-a-Ride Problem with Transfers Barth, Jonas Reiter, Kendra Schmidt, Marie dial-a-ride line-based transfers on-demand ridepooling 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jonas Barth and Kendra Reiter and Marie Schmidt 2025 Is Part Of OASIcs, Volume 137, 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2025.17 urn:nbn:de:0030-drops-247736 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2025.17 eng https://creativecommons.org/licenses/by/4.0/legalcode