University of Twente Student Theses


Routing of shunt trains at logistics hubs of NS using constraint programming

Wattel, N.J. (2021) Routing of shunt trains at logistics hubs of NS using constraint programming.

[img] PDF
Abstract:This research explored the usage of constraint programming to find routes and times for shunt trains at logistics hubs of NS. NS currently uses HIP (Hybrid Integral Planning Method) which contains amongst other a local search to integrally solve the Train Unit Shunting Problem (TUSP). TUSP is defined as the problem of routing, parking, planning services and matching shunt trains on a station with one or multiple shunting yards. Finding routes seems to be the hardest part for HIP and constraint programming could be powerful to find the routes. In this research a constraint programming model has been developed which finds the routes and times for all shunt trains in a 24-hour planning horizon and use that as input for the local search in HIP. The goal is to check if and how constraint programming can be used to shorten the computation time of HIP. Multiple experiments have been developed and results are promising in terms of running time. Using constraint programming resulted in several cases in a reduction of more than 95% of running time.
Item Type:Essay (Master)
Nederlandse Spoorwegen
Supply Value
Faculty:BMS: Behavioural, Management and Social Sciences
Subject:30 exact sciences in general, 50 technical science in general
Programme:Industrial Engineering and Management MSc (60029)
Link to this item:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page