Analysis of Shunting Yard Usage and Train Unit Clustering

Bachelor Thesis (2024)
Author(s)

I.S. Yordanov (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Contributor(s)

MM de Weerdt – Mentor (TU Delft - Algorithmics)

I.K. Hanou – Mentor (TU Delft - Algorithmics)

Jing Sun – Graduation committee member (TU Delft - Pattern Recognition and Bioinformatics)

Faculty
Electrical Engineering, Mathematics and Computer Science
More Info
expand_more
Publication Year
2024
Language
English
Graduation Date
23-06-2024
Awarding Institution
Delft University of Technology
Project
CSE3000 Research Project
Programme
Computer Science and Engineering
Faculty
Electrical Engineering, Mathematics and Computer Science
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

This research aims to find patterns in the live position data of trains within shunting yards. These patterns can be converted to heuristics and applied in algorithms developed by railway operators in the Netherlands to tackle the Train Unit Shunting Problem. The usage patterns were extracted from real-world location data of train units. Specifically, this research focuses on finding patterns in the paths taken in both temporal and spatial metrics. These investigations identified the busiest times in the shunting yards according to various metrics, such as the total number of trains and the number of serviced trains. These metrics are extracted from the type of train movement at a given moment, which was provided with the dataset. The accuracy of the provided train movement category has been analyzed and shown to be inaccurate for uses within shunting yards compared to a proposed approach. Finally, an algorithm for classifying train units that belong to the same train has been shown to have initial success.

Files

License info not available