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

Incremental Heuristics for Periodic Timetabling

Please always quote using this URN: urn:nbn:de:0297-zib-92309
accepted for publication
  • 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.

Download full text files

Export metadata

Author:Niels LindnerORCiD, Christian LiebchenORCiD
Document Type:ZIB-Report
Tag:Mixed-Integer Programming; Public Transport; Timetabling
CCS-Classification:J. Computer Applications
Date of first Publication:2023/09/22
Series (Serial Number):ZIB-Report (23-22)
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.