Timetabling is a classical and complex task for public transport operators as well as for railway undertakings. The general question is: Which vehicle is taking which route through the transportation network in which order? In this paper, we consider the special setting to find optimal timetables for railway systems under a moving block regime. We directly set up on our work of [T. Schlechte et al., 2022], i.e., we consider the same model formulation and real-world instances of a moving block headway system. In this paper, we present a repair heuristic and a lazy-constraint approach utilizing the callback features of Gurobi, see [Gurobi Optimization, 2022]. We provide an experimental study of the different algorithmic approaches for a railway network with 100 and up to 300 train requests. The computational results show that the lazy-constraint approach together with the repair heuristic significantly improves our previous approaches.
@InProceedings{klug_et_al:OASIcs.ATMOS.2022.11, author = {Klug, Torsten and Reuther, Markus and Schlechte, Thomas}, title = {{Does Laziness Pay Off? - A Lazy-Constraint Approach to Timetabling}}, booktitle = {22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022)}, pages = {11:1--11:8}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-259-4}, ISSN = {2190-6807}, year = {2022}, volume = {106}, editor = {D'Emidio, Mattia and Lindner, Niels}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2022.11}, URN = {urn:nbn:de:0030-drops-171159}, doi = {10.4230/OASIcs.ATMOS.2022.11}, annote = {Keywords: Moving Block, Railway Track Allocation, Timetabling, Train Routing} }
Feedback for Dagstuhl Publishing