Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Incremental Heuristics for Periodic Timetabling

  • We present incremental heuristics for the Periodic Event Scheduling Problem (PESP), the standard mathematical tool to optimize periodic timetables in public transport. The core of our method is to solve successively larger subinstances making use of previously found solutions. Introducing the technical notion of free stratifications, we formulate a general scheme for incremental heuristics for PESP. More practically, we use line and station information to create heuristics that add lines or stations one by one, and we evaluate these heuristics on instances of the benchmarking library PESPlib. This approach is indeed viable, and leads to new incumbent solutions for six PESPlib instances.
Metadaten
Author:Niels LindnerORCiD, Christian LiebchenORCiD
Editor:Guido Voigt, Malte Fliedner, Knut Haase, Wolfgang Brüggemann, Kai Hoberg, Jörn Meissner
Document Type:In Proceedings
Parent Title (English):Operations Research Proceedings 2023
First Page:461
Last Page:467
Series:Lecture Notes in Operations Research
Publisher:Springer Nature Switzerland
Place of publication:Cham
Year of first publication:2025
Preprint:urn:nbn:de:0297-zib-92309
DOI:https://doi.org/10.1007/978-3-031-58405-3_59
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.