DROPS

Artifact

Software

DOI: 10.4230/artifacts.24588

liDARPT

Authors: Jonas Barth

Abstract

Cite as

Jonas Barth. liDARPT (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@misc{dagstuhl-artifact-24588,
   title = {{liDARPT}}, 
   author = {Barth, Jonas},
   note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:f4c2255f2efac8e14d97cf8b152dd7df1a83841a;origin=https://github.com/barjon0/liDARPT;visit=swh:1:snp:9e991754ac51080c4671363ee2e149da96bd534e;anchor=swh:1:rev:eae0411fec481c24c2f82a32bf3319292f47c08a}{\texttt{swh:1:dir:f4c2255f2efac8e14d97cf8b152dd7df1a83841a}} (visited on 2025-10-17)},
   url = {https://github.com/barjon0/liDARPT},
   doi = {10.4230/artifacts.24588},
}

Document

DOI: 10.4230/OASIcs.ATMOS.2025.17

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

Authors: Jonas Barth, Kendra Reiter, and Marie Schmidt

Published in: OASIcs, Volume 137, 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)

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

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)

Copy BibTex To Clipboard

@InProceedings{barth_et_al:OASIcs.ATMOS.2025.17,
  author =	{Barth, Jonas and Reiter, Kendra and Schmidt, Marie},
  title =	{{The Line-Based Dial-a-Ride Problem with Transfers}},
  booktitle =	{25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)},
  pages =	{17:1--17:20},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-404-8},
  ISSN =	{2190-6807},
  year =	{2025},
  volume =	{137},
  editor =	{Sauer, Jonas and Schmidt, Marie},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2025.17},
  URN =		{urn:nbn:de:0030-drops-247736},
  doi =		{10.4230/OASIcs.ATMOS.2025.17},
  annote =	{Keywords: dial-a-ride, line-based, transfers, on-demand, ridepooling}
}

Search Results

Documents authored by Barth, Jonas

liDARPT

Abstract

Cite as

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

Abstract

Cite as

Thanks for your feedback!

Could not send message