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.

Additional Metadata
Keywords Crew rescheduling, Depth-first iterative-deepening, Heuristic, Railway optimization, Real-time rescheduling
Persistent URL dx.doi.org/10.1007/s12469-017-0155-1, hdl.handle.net/1765/100737
Series Econometric Institute Reprint Series
Journal Public Transport
Verhaegh, T, Huisman, D, Fioole, P-J, & Vera, J.C. (2017). A heuristic for real-time crew rescheduling during small disruptions. Public Transport, 9(1-2), 325–342. doi:10.1007/s12469-017-0155-1