A heuristic for real-time crew rescheduling during small disruptions

Due to unforeseen problems, disruptions occur in passenger railway operations. Proper real-time crew management is needed to prevent disruptions to spread over space and time. Netherlands Railways has algorithmic support from a solver to obtain good crew rescheduling solutions during big disruptions. However, small disruptions are still manually solved by human dispatchers who have limited solving capacity. In this paper the rescheduling for crews during small disruptions is modeled as inserting an uncovered task in a feasible set of duties. The problem is solved as an iterative-deepening depth-first search in a tree. To reduce computation time, we use several ideas to prune unpromising parts of the tree. We have tested the heuristic on about 5000 test instances obtained from real-world data. These tests show that the heuristic delivers good and desirable rescheduling solutions within at most 2 s.

  • Record URL:
  • Availability:
  • Supplemental Notes:
    • Copyright © 2017, Springer-Verlag Berlin Heidelberg. The contents of this paper reflect the views of the authors and do not necessarily reflect the official views or policies of the Transportation Research Board or the National Academy of Sciences.
  • Authors:
    • Verhaegh, Thijs
    • Huisman, Dennis
    • Fioole, Pieter-Jan
    • Vera, Juan C
  • Publication Date: 2017-7

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01641148
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jun 26 2017 2:03PM