Column generation with dynamic duty selection for railway crew rescheduling
2008-12-19
Research Paper
pp 1-25.
This publication is part of collection
| Related Files |
|---|
View PDF Version
(EI2008-28.pdf, 0.2MB) |
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.
Automatically Extracted Terms
- problem
- core problem
- solution
- reserve duties
- number
- reserve
- column
- core problems
- completion
- station
- crew schedule
- driver
- neighborhood
- disruption
- train
- schedule
- railway
- task j
- instance
- column generation
