The train driver recovery problem - A set partitioning based model and solution method

@article{Rezanova2010TheTD,
  title={The train driver recovery problem - A set partitioning based model and solution method},
  author={Natalia J. Rezanova and David M. Ryan},
  journal={Computers & OR},
  year={2010},
  volume={37},
  pages={845-856}
}
The need to recover a train driver schedule occurs during major disruptions in the daily railway operations. Using data from the train driver schedule of the Danish passenger railway operator DSB S-tog A/S, a solution method to the Train Driver Recovery Problem (TDRP) is developed. The TDRP is formulated as a set partitioning problem. The LP relaxation of the set partitioning formulation of the TDRP possesses strong integer properties. The proposed model is therefore solved via the LP… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 25 extracted citations

Real-time freight locomotive rescheduling and uncovered train detection during disruption

European Journal of Operational Research • 2012
View 6 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 11 references

A column generation approach for the rail crew re-scheduling problem

European Journal of Operational Research • 2007
View 1 Excerpt

The solution of massive generalized set partitioning problems in aircrew rostering

D. M. Ryan
The Journal of the Operational Research Society, • 1992
View 2 Excerpts

On the integer properties of scheduling set partitioning models

D. M. Ryan, J. C. Falkner
European Journal of Operational Research, • 1988
View 2 Excerpts

Padberg . Perfect zero - one matrices

D. M. Ryan.
Mathematical Programming • 1974

Similar Papers

Loading similar papers…