2026-08-15T15:21:27Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:23894 2025-11-12T13:11:07Z ddc:004 open_access

Constraint-Based In-Station Train Dispatching Schutt, Andreas Cardellini, Matteo Dekker, Jip J. Harabor, Daniel Maratea, Marco Vallati, Mauro in-station train dispatching train scheduling railway scheduling constraint programming mixed-integer programming In-station dispatching is the problem of planning the movements of scheduled trains inside a railway station. Effective solutions for in-station dispatching are important for maximising the utilisation of railway infrastructure and for mitigating the impact of incidents and delays in the broader network. In this paper, we explore a constraint-based approach to perform in-station train dispatching. Our extensive empirical analysis of multiple modelling, search strategy, and solver choices, performed over synthetically generated, yet realistic, data, shows that our method outperforms the existing planning-based state-of-the-art approach. In addition, we present different optimisation criteria, which can be effortless defined thanks to the constraint-based approach. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Andreas Schutt and Matteo Cardellini and Jip J. Dekker and Daniel Harabor and Marco Maratea and Mauro Vallati 2025 Is Part Of LIPIcs, Volume 340, 31st International Conference on Principles and Practice of Constraint Programming (CP 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CP.2025.33 urn:nbn:de:0030-drops-238941 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2025.33 eng https://creativecommons.org/licenses/by/4.0/legalcode