Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorHoogeveen, J.A.
dc.contributor.advisorAkker, J.M. van den
dc.contributor.authorBroek, R.W. van den
dc.date.accessioned2016-09-05T17:01:11Z
dc.date.available2016-09-05T17:01:11Z
dc.date.issued2016
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/24118
dc.description.abstractTrains have to be maintained and cleaned regularly to ensure high passenger safety and satisfaction. These service tasks must be performed outside the rush hours, when the trains are parked off the main railway network at dedicated service sites. The activities on a service site are currently scheduled by hand; a difficult and time-consuming task that consists of matching incoming and outgoing trains, scheduling the service tasks, assigning trains to parking tracks and routing the trains over the service site. We propose a local search approach for the automated construction of such shunt plans that integrates these four planning aspects. Our heuristic is applied successfully to artificial and real-world planning problems, and outperforms a state-of-the-art mixed integer programming algorithm.
dc.description.sponsorshipUtrecht University
dc.format.extent1124538
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleTrain Shunting and Service Scheduling: an integrated local search approach
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordsTrain; Shunting; Maching Scheduling; Routing; Service; Maintenance
dc.subject.courseuuComputing Science


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record