Examining Manual Solutions of the Train Unit Shunting Problem to find Train Type Patterns

Bachelor Thesis (2024)
Author(s)

M. van Pelt (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Contributor(s)

M.M. de Weerdt – Mentor (TU Delft - Algorithmics)

Issa 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
27-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 paper analyses manually realised solutions to the Train Unit Shunting Problem (TUSP) to find patterns in train type. The parking element is most important for the TUSP. Therefore, this research specifically investigates the presence of train type patterns in parking track and parking time. The difference in the patterns between main train type and train subtype is also analysed. The study uses statistical hypothesis testing to look for biases between individual train types and parking tracks. Kernel density estimation is used to analyse the differences in parking time between the types. The results show that there are strong patterns in type and parking track, but no clear difference in parking time. Considering subtype results in the differences being more specific. It is suspected that the strongly present track pattern is a strategy used by human planners.

Files

License info not available