25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 1-342, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@Proceedings{sauer_et_al:OASIcs.ATMOS.2025, title = {{OASIcs, Volume 137, ATMOS 2025, Complete Volume}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {1--342}, 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}, URN = {urn:nbn:de:0030-drops-248922}, doi = {10.4230/OASIcs.ATMOS.2025}, annote = {Keywords: OASIcs, Volume 137, ATMOS 2025, Complete Volume} }
25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{sauer_et_al:OASIcs.ATMOS.2025.0, author = {Sauer, Jonas and Schmidt, Marie}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {0:i--0:xii}, 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.0}, URN = {urn:nbn:de:0030-drops-248915}, doi = {10.4230/OASIcs.ATMOS.2025.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Rolf Nelson van Lieshout and Bartholomeüs Theodorus Cornelis van Rossum. The Fair Periodic Assignment Problem. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 1:1-1:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{vanlieshout_et_al:OASIcs.ATMOS.2025.1, author = {van Lieshout, Rolf Nelson and van Rossum, Bartholome\"{u}s Theodorus Cornelis}, title = {{The Fair Periodic Assignment Problem}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {1:1--1:16}, 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.1}, URN = {urn:nbn:de:0030-drops-247574}, doi = {10.4230/OASIcs.ATMOS.2025.1}, annote = {Keywords: Cyclic scheduling, Fairness, Traveling Salesman Problem} }
Fabian Löbel and Niels Lindner. A Geometric Approach to Integrated Periodic Timetabling and Passenger Routing. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 2:1-2:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{lobel_et_al:OASIcs.ATMOS.2025.2, author = {L\"{o}bel, Fabian and Lindner, Niels}, title = {{A Geometric Approach to Integrated Periodic Timetabling and Passenger Routing}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {2:1--2:19}, 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.2}, URN = {urn:nbn:de:0030-drops-247580}, doi = {10.4230/OASIcs.ATMOS.2025.2}, annote = {Keywords: Periodic Timetabling, Passenger Routing, Polyhedral Complexes} }
Julia Meusel, Matthias Müller-Hannemann, and Klaus Reinhardt. Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 3:1-3:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{meusel_et_al:OASIcs.ATMOS.2025.3, author = {Meusel, Julia and M\"{u}ller-Hannemann, Matthias and Reinhardt, Klaus}, title = {{Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {3:1--3:22}, 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.3}, URN = {urn:nbn:de:0030-drops-247594}, doi = {10.4230/OASIcs.ATMOS.2025.3}, annote = {Keywords: Periodic timetabling, service quality, temporal graph, graph realization, complexity} }
Johann Hartleb, Marie Schmidt, Samuel Wolf, and Alexander Wolff. Visualization of Event Graphs for Train Schedules. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 4:1-4:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{hartleb_et_al:OASIcs.ATMOS.2025.4, author = {Hartleb, Johann and Schmidt, Marie and Wolf, Samuel and Wolff, Alexander}, title = {{Visualization of Event Graphs for Train Schedules}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {4:1--4: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.4}, URN = {urn:nbn:de:0030-drops-247607}, doi = {10.4230/OASIcs.ATMOS.2025.4}, annote = {Keywords: Graph Drawing, Event Graphs, Integer Linear Programming, Parameterized Algorithms, Treewidth} }
Shaul Rosner and Tami Tamir. Throughput Maximization in a Scheduling Environment with Machine-Dependent Due-Dates. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 5:1-5:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{rosner_et_al:OASIcs.ATMOS.2025.5, author = {Rosner, Shaul and Tamir, Tami}, title = {{Throughput Maximization in a Scheduling Environment with Machine-Dependent Due-Dates}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {5:1--5:10}, 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.5}, URN = {urn:nbn:de:0030-drops-247616}, doi = {10.4230/OASIcs.ATMOS.2025.5}, annote = {Keywords: Scheduling, Throughput maximization, Machine-dependent due-dates, Computational Complexity} }
Konstantinos Karathanasis, Spyros Kontogiannis, Asterios Pegos, Vasileios Sofianos, and Christos Zaroliagis. VRP-Inspired Techniques for Discrete Dynamic Berth Allocation and Scheduling. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 6:1-6:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{karathanasis_et_al:OASIcs.ATMOS.2025.6, author = {Karathanasis, Konstantinos and Kontogiannis, Spyros and Pegos, Asterios and Sofianos, Vasileios and Zaroliagis, Christos}, title = {{VRP-Inspired Techniques for Discrete Dynamic Berth Allocation and Scheduling}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {6:1--6:21}, 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.6}, URN = {urn:nbn:de:0030-drops-247625}, doi = {10.4230/OASIcs.ATMOS.2025.6}, annote = {Keywords: Berth Allocation and Scheduling, Heuristics, Metaheuristics, Mixed Integer Linear Programming} }
Christopher Hojny, Frits C.R. Spieksma, and Sten Wessel. Evaluating Fairness of Sequential Resource Allocation Policies: A Computational Study. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 7:1-7:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{hojny_et_al:OASIcs.ATMOS.2025.7, author = {Hojny, Christopher and Spieksma, Frits C.R. and Wessel, Sten}, title = {{Evaluating Fairness of Sequential Resource Allocation Policies: A Computational Study}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {7:1--7:14}, 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.7}, URN = {urn:nbn:de:0030-drops-247635}, doi = {10.4230/OASIcs.ATMOS.2025.7}, annote = {Keywords: fairness, resource allocation, computational analysis} }
Sven Mallach. Refined Integer Programs and Polyhedral Results for the Target Visitation Problem. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 8:1-8:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{mallach:OASIcs.ATMOS.2025.8, author = {Mallach, Sven}, title = {{Refined Integer Programs and Polyhedral Results for the Target Visitation Problem}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {8:1--8:17}, 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.8}, URN = {urn:nbn:de:0030-drops-247647}, doi = {10.4230/OASIcs.ATMOS.2025.8}, annote = {Keywords: Route planning, Transportation, Logistics, Traveling salesman problem, Linear ordering problem, Polyhedral Combinatorics, Branch-and-cut, Integer Programming, Linear programming} }
Ugo Rosolia, Marc Bataillou Almagro, George Iosifidis, Martin Gross, and Georgios Paschos. Speed-Aware Network Design: A Parametric Optimization Approach. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{rosolia_et_al:OASIcs.ATMOS.2025.9, author = {Rosolia, Ugo and Almagro, Marc Bataillou and Iosifidis, George and Gross, Martin and Paschos, Georgios}, title = {{Speed-Aware Network Design: A Parametric Optimization Approach}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {9:1--9:16}, 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.9}, URN = {urn:nbn:de:0030-drops-247655}, doi = {10.4230/OASIcs.ATMOS.2025.9}, annote = {Keywords: Network Design, Transportation Networks, Mixed-Integer Programming, Speed-Coverage, Parametric Optimization} }
Caleb Eardley, Dalton Gomez, Ryan Dupuis, Michael Papadopoulos, and Sean Yaw. A Genetic Algorithm for Multi-Capacity Fixed-Charge Flow Network Design. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{eardley_et_al:OASIcs.ATMOS.2025.10, author = {Eardley, Caleb and Gomez, Dalton and Dupuis, Ryan and Papadopoulos, Michael and Yaw, Sean}, title = {{A Genetic Algorithm for Multi-Capacity Fixed-Charge Flow Network Design}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {10:1--10:14}, 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.10}, URN = {urn:nbn:de:0030-drops-247661}, doi = {10.4230/OASIcs.ATMOS.2025.10}, annote = {Keywords: Fixed-Charge Network Flow, Genetic Algorithm, Matheuristic, Infrastructure Design} }
Philine Schiewe, Anita Schöbel, and Reena Urban. Design of Distance Tariffs in Public Transport. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 11:1-11:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{schiewe_et_al:OASIcs.ATMOS.2025.11, author = {Schiewe, Philine and Sch\"{o}bel, Anita and Urban, Reena}, title = {{Design of Distance Tariffs in Public Transport}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {11:1--11: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.11}, URN = {urn:nbn:de:0030-drops-247670}, doi = {10.4230/OASIcs.ATMOS.2025.11}, annote = {Keywords: public transport, fare strategy, distance tariff} }
Scott Bacherle, Thomas Bläsius, and Michael Zündorf. Separator-Based Alternative Paths in Customizable Contraction Hierarchies. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 12:1-12:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{bacherle_et_al:OASIcs.ATMOS.2025.12, author = {Bacherle, Scott and Bl\"{a}sius, Thomas and Z\"{u}ndorf, Michael}, title = {{Separator-Based Alternative Paths in Customizable Contraction Hierarchies}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {12:1--12:16}, 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.12}, URN = {urn:nbn:de:0030-drops-247685}, doi = {10.4230/OASIcs.ATMOS.2025.12}, annote = {Keywords: Alternative routes, realistic road networks, customizable contraction hierarchies, route planning, shortest paths} }
Carina Truschel and Sabine Storandt. Multi-Criteria Route Planning with Little Regret. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 13:1-13:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{truschel_et_al:OASIcs.ATMOS.2025.13, author = {Truschel, Carina and Storandt, Sabine}, title = {{Multi-Criteria Route Planning with Little Regret}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {13:1--13: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.13}, URN = {urn:nbn:de:0030-drops-247698}, doi = {10.4230/OASIcs.ATMOS.2025.13}, annote = {Keywords: Pareto-optimality, Regret minimization, Contraction Hierarchies} }
Stefan Engels and Robert Wille. Using A* for Optimal Train Routing on Moving Block Systems. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{engels_et_al:OASIcs.ATMOS.2025.14, author = {Engels, Stefan and Wille, Robert}, title = {{Using A* for Optimal Train Routing on Moving Block Systems}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {14:1--14:18}, 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.14}, URN = {urn:nbn:de:0030-drops-247701}, doi = {10.4230/OASIcs.ATMOS.2025.14}, annote = {Keywords: ETCS, Train Routing, Moving Block, A*, Munich Train Control Toolkit} }
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)
@InProceedings{breitling_et_al:OASIcs.ATMOS.2025.15, author = {Breitling, Johannes and Laupichler, Moritz}, title = {{Exact and Heuristic Dynamic Taxi Sharing with Transfers Using Shortest-Path Speedup Techniques}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {15:1--15:22}, 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.15}, URN = {urn:nbn:de:0030-drops-247718}, doi = {10.4230/OASIcs.ATMOS.2025.15}, annote = {Keywords: Dynamic taxi sharing, ride pooling, dial-a-ride problem, transfers, route planning} }
Lena Dittrich, Michael Rihlmann, Sarah Roth, and Anita Schöbel. A Model for Strategic Ridepooling and Its Integration with Line Planning. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 16:1-16:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{dittrich_et_al:OASIcs.ATMOS.2025.16, author = {Dittrich, Lena and Rihlmann, Michael and Roth, Sarah and Sch\"{o}bel, Anita}, title = {{A Model for Strategic Ridepooling and Its Integration with Line Planning}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {16:1--16: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.16}, URN = {urn:nbn:de:0030-drops-247720}, doi = {10.4230/OASIcs.ATMOS.2025.16}, annote = {Keywords: Multi-modal planning, Line plan, Ridepooling, Integrated models} }
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)
@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} }
Sarah Roth and Anita Schöbel. Energy-Efficient Line Planning by Implementing Express Lines. In 25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025). Open Access Series in Informatics (OASIcs), Volume 137, pp. 18:1-18:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{roth_et_al:OASIcs.ATMOS.2025.18, author = {Roth, Sarah and Sch\"{o}bel, Anita}, title = {{Energy-Efficient Line Planning by Implementing Express Lines}}, booktitle = {25th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2025)}, pages = {18:1--18:21}, 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.18}, URN = {urn:nbn:de:0030-drops-247746}, doi = {10.4230/OASIcs.ATMOS.2025.18}, annote = {Keywords: Line Planning, Express Lines, Sustainable Public Transport} }