TY - JOUR A1 - Masing, Berenike A1 - Lindner, Niels A1 - Liebchen, Christian T1 - Periodic timetabling with integrated track choice for railway construction sites JF - Journal of Rail Transport Planning & Management N2 - We propose a mixed-integer linear programming model to generate and optimize periodic timetables with integrated track choice in the context of railway construction sites. When a section of a railway network becomes unavailable, the nearby areas are typically operated close to their capacity limits, and hence carefully modeling headways and allowing flexible routings becomes vital. We therefore discuss first how to integrate headway constraints into the Periodic Event Scheduling Problem (PESP) that do not only prevent overtaking, but also guarantee conflict-free timetables in general and particularly inside stations. Secondly, we introduce a turn-sensitive event-activity network, which is able to integrate routing alternatives for turnarounds at stations, e.g., turning at a platform vs. at a pocket track for metro-like systems. We propose several model formulations to include track choice, and finally evaluate them on six real construction site scenarios on the S-Bahn Berlin network. Y1 - 2023 U6 - https://doi.org/10.1016/j.jrtpm.2023.100416 VL - 28 SP - 100416 ER - TY - JOUR A1 - Lindner, Niels A1 - Liebchen, Christian T1 - Timetable merging for the Periodic Event Scheduling Problem JF - EURO Journal on Transportation and Logistics N2 - We propose a new mixed integer programming based heuristic for computing new benchmark primal solutions for instances of the PESPlib. The PESPlib is a collection of instances for the Periodic Event Scheduling Problem (PESP), comprising periodic timetabling problems inspired by real-world railway timetabling settings, and attracting several international research teams during the last years. We describe two strategies to merge a set of good periodic timetables. These make use of the instance structure and minimum weight cycle bases, finally leading to restricted mixed integer programming formulations with tighter variable bounds. Implementing this timetable merging approach in a concurrent solver, we improve the objective values of the best known solutions for the smallest and largest PESPlib instances by 1.7 and 4.3 percent, respectively. Y1 - 2022 U6 - https://doi.org/10.1016/j.ejtl.2022.100081 VL - 11 SP - 100081 ER -