Rescheduling rail networks with maintenance disruptions using Problem Space Search

Rescheduling rail networks with maintenance disruptions using Problem Space Search

0.00 Avg rating0 Votes
Article ID: iaor20127822
Volume: 40
Issue: 3
Start Page Number: 703
End Page Number: 712
Publication Date: Mar 2013
Journal: Computers and Operations Research
Authors: , ,
Keywords: maintenance, repair & replacement, vehicle routing & scheduling, timetabling, heuristics
Abstract:

The 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 480km, has 57 crossing loops and typically carries over 50 trains per day is discussed. This paper details a fast and efficient heuristic for the simultaneous scheduling of trains and track maintenance in a large scale rail network. We also show how the heuristic can work in a dynamic environment in which disruptions occur.

Reviews

Required fields are marked *. Your email address will not be published.