Article ID: | iaor20164341 |
Volume: | 50 |
Issue: | 1 |
Start Page Number: | 204 |
End Page Number: | 215 |
Publication Date: | Feb 2016 |
Journal: | Transportation Science |
Authors: | Huisman Dennis, Marti Gbor, Wagelmans Albert P M, Potthoff Daniel, Veelenturf Lucas P, Kroon Leo G |
Keywords: | scheduling, combinatorial optimization, transportation: rail |
This paper studies the real‐time crew rescheduling problem in case of large‐scale disruptions. One of the greatest challenges of real‐time disruption management is the unknown duration of the disruption. In this paper we present a novel approach for crew rescheduling where we deal with this uncertainty by considering several scenarios for the duration of the disruption. The rescheduling problem is similar to a two‐stage optimization problem. In the first stage, at the start of the disruption, we reschedule the plan based on the optimistic scenario (i.e., assuming the shortest possible duration of the disruption), while taking into account the possibility that another scenario will be realized. We require a prescribed number of the rescheduled crew duties (a sequential list of tasks which have to be performed by a single crew member) to be