Rescheduling rail networks with maintenance disruptions using problem space search

dc.contributor.authorAlbrecht, A.R.
dc.contributor.authorPanton, D.M.
dc.contributor.authorLee, D.H.
dc.date.issued2013
dc.description.abstractThe creation of train timetables for long-haul single track networks is a challenging process. This task is more difficult if track maintenance disruptions are to be taken into account. This paper describes how the Problem Space Search (PSS) meta-heuristic can be used for large scale problems to create quality timetables in which both train movements and scheduled track maintenance are simultaneously considered. We show that the PSS meta-heuristic can rapidly generate a large number of alternative train timetables and then describe how the technique is generalized to construct an integrated timetable which includes track maintenance. We show how the technique can also be used as an operational tool where a revised schedule can be quickly generated to take into account the new state of a disrupted system. A case study for a single track rail network in Queensland Australia, which spans a distance of 480 km, has 57 crossing loops and typically carries over 50 trains per day is discussed.
dc.identifier.citationComputers & Operations Research, 2013; 40(3):703-712
dc.identifier.doi10.1016/j.cor.2010.09.001
dc.identifier.issn0305-0548
dc.identifier.issn1873-765X
dc.identifier.urihttps://hdl.handle.net/1959.8/129465
dc.language.isoen
dc.publisherPergamon
dc.relation.fundingAustralian Cooperative Research Centre for Railway Engineering and Technologies
dc.rightsCrown Copyright 2010 Published by Elsevier
dc.source.urihttps://doi.org/10.1016/j.cor.2010.09.001
dc.subjectrail transportation
dc.subjectdisruption recovery
dc.subjectscheduling
dc.subjectmeta-heuristics
dc.titleRescheduling rail networks with maintenance disruptions using problem space search
dc.typeJournal article
pubs.publication-statusPublished
ror.mmsid9915910600301831

Files

Collections