dc.rights.license | CC-BY-NC-ND | |
dc.contributor.advisor | Hoogeveen, J.A. | |
dc.contributor.advisor | van den Akker, J.M. | |
dc.contributor.author | Onomiwo, E.A.S. | |
dc.date.accessioned | 2020-09-29T18:00:13Z | |
dc.date.available | 2020-09-29T18:00:13Z | |
dc.date.issued | 2020 | |
dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/37757 | |
dc.description.abstract | Trains are cleaned and inspected regularly to keep passengers happy, and costs low by preventing accidents. These services are done within a shunting yard based on a schedule created by the Dutch Railways. In practice, the execution of a schedule often deviates because a train arrives too late, or arrives with carriages in an unexpected order. If these disruptions break the schedule in any way, it will have to be corrected manually. We propose a local search technique to aid the adjustment of the schedule, while also aiming for the resulting schedule to be similar to the original. We introduce a score for similarity based on comparing the machinist schedules. | |
dc.description.sponsorship | Utrecht University | |
dc.format.extent | 881150 | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | |
dc.title | Disruption Management on Shunting Yards with Tabu Search and Simulated Annealing | |
dc.type.content | Master Thesis | |
dc.rights.accessrights | Open Access | |
dc.subject.keywords | trains, NS, shunting yard, disruption management, local search, tabu search, simulated annealing | |
dc.subject.courseuu | Computing Science | |