Solving the periodic scheduling problem: An assignment approach in non-periodic networks
Grafe V, Schöbel A (2021)
Publication Type: Conference contribution
Publication year: 2021
Journal
Publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Book Volume: 96
Conference Proceedings Title: OpenAccess Series in Informatics
Event location: Virtual, Lisbon, PRT
ISBN: 9783959772136
DOI: 10.4230/OASIcs.ATMOS.2021.9
Abstract
The periodic event scheduling problem (PESP) is a well researched problem used for finding good periodic timetables in public transport. While it is based on a periodic network consisting of events and activities which are repeated every period, we propose a new periodic timetabling model using a non-periodic network. This is a first step towards the goal of integrating periodic timetabling with other planning steps taking place in the aperiodic network, e.g. passenger assignment or delay management. In this paper, we develop the new model, show how we can reduce its size and prove its equivalence to PESP. We also conduct computational experiments on close-to real-world data from Lower Saxony, a region in northern Germany, and see that the model can be solved in a reasonable amount of time.
Involved external institutions
Germany (DE)How to cite
APA:
Grafe, V., & Schöbel, A. (2021). Solving the periodic scheduling problem: An assignment approach in non-periodic networks. In Matthias Muller-Hannemann, Federico Perea (Eds.), OpenAccess Series in Informatics. Virtual, Lisbon, PRT: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
MLA:
Grafe, Vera, and Anita Schöbel. "Solving the periodic scheduling problem: An assignment approach in non-periodic networks." Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2021, Virtual, Lisbon, PRT Ed. Matthias Muller-Hannemann, Federico Perea, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2021.
BibTeX: Download