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.
Constraint-Based In-Station Train Dispatching / Schutt, Andreas; Cardellini, Matteo; Dekker, Jip J.; Harabor, Daniel; Maratea, Marco; Vallati, Mauro. - 340:(2025), pp. 1-24. (Intervento presentato al convegno International Conference on Principles and Practice of Constraint Programming (CP) tenutosi a Glasgow, Scotland (UK) nel August 10-15, 2025) [10.4230/lipics.cp.2025.33].
Constraint-Based In-Station Train Dispatching
Matteo Cardellini;
2025
Abstract
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.File | Dimensione | Formato | |
---|---|---|---|
LIPIcs.CP.2025.33.pdf
accesso aperto
Tipologia:
2a Post-print versione editoriale / Version of Record
Licenza:
Creative commons
Dimensione
962.06 kB
Formato
Adobe PDF
|
962.06 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/3002392