A Data-Driven Problem Reduction Framework for Local Train Rescheduling in Station Areas

Research output: Contribution to book/Conference proceedings/Anthology/ReportConference contributionContributedpeer-review

Abstract

Real-time train rescheduling using exact mathematical optimization is challenged by the computational complexity of large-scale disruptions. This paper introduces a machine learning-based framework that reduces problem complexity by fixing a subset of decision variables prior to optimization. The approach fixes nominal route choices of trains by predicting infrastructure-related features, allowing for an effective reduction of the search space for exact solvers. Therefore, Random Forest and Logistic Regression classifiers are trained on generated disruption scenarios and corresponding high-quality rescheduling solutions. We evaluate the proposed framework on a real-world medium-sized station area in Germany. Results show that the method reduces computation time by well over 90 %, while maintaining high feasibility and competitive solution quality. This work demonstrates the potential of hybrid rescheduling methods for intelligent railway operations and offers a promising tool for real-time dispatching support.

Details

Original languageEnglish
Title of host publication2025 IEEE International Conference on Intelligent Rail Transportation, ICIRT 2025
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages194-199
Number of pages6
ISBN (electronic)979-8-3315-9751-1
ISBN (print)979-8-3315-9752-8
Publication statusPublished - 2025
Peer-reviewedYes

Conference

Title2025 IEEE International Conference on Intelligent Rail Transportation
SubtitleArtificial Intelligence in Railway Operation
Abbreviated titleIEEE ICIRT 2025
Duration11 - 12 October 2025
Website
Degree of recognitionInternational event
LocationIV Seasons Yuyuan Hotel
CityBeijing
CountryChina

External IDs

ORCID /0000-0002-1424-5741/work/204616480
ORCID /0000-0003-4111-2255/work/204619154
ORCID /0009-0001-0944-5191/work/204620161

Keywords