Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorHoogeveen, J.A.
dc.contributor.advisorvan den Akker, J.M.
dc.contributor.authorOnomiwo, E.A.S.
dc.date.accessioned2020-09-29T18:00:13Z
dc.date.available2020-09-29T18:00:13Z
dc.date.issued2020
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/37757
dc.description.abstractTrains 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.sponsorshipUtrecht University
dc.format.extent881150
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleDisruption Management on Shunting Yards with Tabu Search and Simulated Annealing
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordstrains, NS, shunting yard, disruption management, local search, tabu search, simulated annealing
dc.subject.courseuuComputing Science


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record