2026-07-20T14:52:17Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:14878 2024-03-06T10:31:35Z ddc:004 open_access

Solving the Periodic Scheduling Problem: An Assignment Approach in Non-Periodic Networks Grafe, Vera Schöbel, Anita Public Transport Periodic Timetabling PESP Integer Programming 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Vera Grafe and Anita Schöbel 2021 Is Part Of OASIcs, Volume 96, 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2021.9 urn:nbn:de:0030-drops-148780 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2021.9 eng https://creativecommons.org/licenses/by/4.0/legalcode