9782 eng reportzib 0 -- 2024-10-09 -- It is well-known that optimal solutions are notoriously hard to find for the Periodic Event Scheduling Problem (PESP), which is the standard mathematical formulation to optimize periodic timetables in public transport. We consider a class of incremental heuristics that have been demonstrated to be effective by Lindner and Liebchen (2023), however, for only one fixed sorting strategy of lines along which a solution is constructed. Thus, in this paper, we examine a variety of sortings based on the number, weight, weighted span, and lower bound of arcs, and test for each setting various combinations of the driving, dwelling, and transfer arcs of lines. Additionally, we assess the impact on the incremental extension of the event-activity network by minimizing resp. maximizing a connectivity measure between subsets of lines. We compare our 27 sortings on the railway instances of the benchmarking library PESPlib within the ConcurrentPESP solver framework. We are able to find five new incumbent solutions, resulting in improvements of up to 2%. 1438-0064 urn:nbn:de:0297-zib-97826 publish 2024-10-07 accepted for publication to appear in Operations Research Proceedings 2024 false true Patricia Ebert Niels Lindner Berenike Masing Niels Lindner Ambros Gleixner 24-07 eng uncontrolled Public Transport eng uncontrolled Timetabling eng uncontrolled Periodic Event Scheduling Computer Applications OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING MODAL-Gesamt Lindner, Niels AI in Society, Science, and Technology Applied Algorithmic Intelligence Methods Network Optimization Masing, Berenike MODAL-MobilityLab Mathplus-PaA3 Applied Optimization https://opus4.kobv.de/opus4-zib/files/9782/ZR-24-07.pdf