Skip to main navigation Skip to search Skip to main content

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.
Original languageEnglish
Title of host publicationProceedings of The 31st International Conference on Principles and Practice of Constraint Programming
Subtitle of host publicationCP 2025
EditorsMaria Garcia de la Banda
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Number of pages24
ISBN (Electronic)9783959773805
DOIs
Publication statusPublished - 8 Aug 2025
Event31st International Conference on Principles and Practice of Constraint Programming - University of Glasgow, Glasgow, United Kingdom
Duration: 10 Aug 202515 Aug 2025
Conference number: 31
https://cp2025.a4cp.org/

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume340
ISSN (Print)1868-8969

Conference

Conference31st International Conference on Principles and Practice of Constraint Programming
Abbreviated titleCP 2025
Country/TerritoryUnited Kingdom
CityGlasgow
Period10/08/2515/08/25
Internet address

Fingerprint

Dive into the research topics of 'Constraint-based In-Station Train Dispatching'. Together they form a unique fingerprint.

Cite this