This is the authors' abstract. We don't add key points for this paper.
The Dutch railway network experiences about three large disruptions per day on average. In this paper, we present an algorithm to reschedule the crews when such a disruption occurs. The algorithm is based on column generation techniques combined with Lagrangian heuristics. Since the number of duties is very large in practical instances, we first define a core problem of tractable size. If some tasks remain uncovered in the solution of the core problem, we perform a neighborhood exploration to improve the solution. Computational experiments with real-life instances show that our method is capable of producing good solutions within a couple of minutes of computation time.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Potthoff et al. (2010) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: