Searched for: subject%3A%22Train%255C+Unit%255C+Shunting%255C+Problem%22
(1 - 9 of 9)
document
Blankenzee, Regino (author)
The planning of railway operations is a very complex process, in which timetables and other logistical plans need to be both reliable and robust to effectively prevent and cope with disturbances. However, research in the robustness of initial stabling plans, designed in an earlier planning phase, during the following planning phases, has been...
master thesis 2023
document
Gribnau, Mees (author)
A shunting yard is used to store trains between arrival and departure. A conflict arises in a shunting yard when one train obstructs another from leaving. Resolving a conflict is done by re-allocating the trains obstructing the departing train to other tracks in the shunting yard. However, these re-allocations complicate the problem at hand and...
bachelor thesis 2023
document
Tian, Tim (author)
This paper explored the usage of the Planning Domain Definition Language in the Train Unit Shunting Problem or TUSP, an NP-hard problem that occurs in train storage. This paper focuses on the evaluation and improvement of existing planners to solve TUSP with multiple shunting yard layouts, as well as an appropriate domain with it. Starting with...
bachelor thesis 2023
document
Chiu, Simba (author)
It is possible to improve the performance of planners by modifying the PDDL domain of a problem. The goal of this research is to implement this to the domain of the Train Unit Shunting Problem (TUSP). The research question we attempt to answer is: To what extent can we improve planner performance by optimizing the PDDL domain of TUSP? The main...
bachelor thesis 2023
document
Athmer, Casper (author)
The Train Unit Shunting and Servicing (TUSS) problem is an NP-hard problem encountered by the Dutch railway operator, Nederlandse Spoorwegen (NS). It considers trains at a shunting yard when they are not transporting passengers. It consists of four subproblems, involving assigning the trains at the yard to a transporting timetable (Matching),...
master thesis 2021
document
van der Knaap, Leon (author)
One of the planning problems encountered by the Dutch Railways (NS) at shunting yards is the train unit shunting problem (TUSP). This problem considers idle train units that have to be parked, be cleaned, undergo regular maintenance, and be reconfigured into the scheduled departing train compositions. A local search algorithm is being developed...
master thesis 2021
document
van der Linden, J.G.M. (author), Mulderij, J. (author), Huisman, B. (author), Den Ouden, Joris W. (author), Van Den Akker, Marjan (author), Hoogeveen, Han (author), de Weerdt, M.M. (author)
When trains are finished with their transportation tasks during the day, they are moved to a shunting yard where they are routed, parked, cleaned, subject to regular maintenance checks and repaired during the night. The resulting Train Unit Shunting and Servicing problem motivates advanced research in planning and scheduling in general since...
conference paper 2021
document
Stelmach, Fabian (author)
This research is focused on the proactive-reactive rescheduling process of the Train Unit Shunting Problem (TUSP) on train maintenance shunting yards. An important difference between a scheduling process and the rescheduling process is that a reschedule must be both feasible and desirable (similar to pre-schedule), while a schedule does not...
master thesis 2020
document
Baurichter, Matthijs (author)
Computers are preferred above humans when dealing with information processing because of the great memory and fast computing times. The use of algorithms within complex planning processes is an interesting research field. These algorithms should help human planners with the planning process and therefore are called Planning Assistance Tools (PAT...
master thesis 2020
Searched for: subject%3A%22Train%255C+Unit%255C+Shunting%255C+Problem%22
(1 - 9 of 9)