Column generation with dynamic duty selection for railway crew rescheduling

Transportation Science

Volumn 44, Issue 4, 2010, Pages 493-505

  Potthoff, Daniel ^a,b   Huisman, Dennis ^a,b   Desaulniers, Guy ^c  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^b Netherlands Railways   (Netherlands)

^c ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

Column generation; Crew scheduling; Railway planning

Indexed keywords

OPTIMIZATION; RAILROAD TRANSPORTATION; RAILROADS; TRANSPORTATION;

COLUMN GENERATION; COMPUTATION TIME; COMPUTATIONAL EXPERIMENT; CORE PROBLEMS; CREW SCHEDULING; LAGRANGIAN HEURISTICS; RAILWAY NETWORK; RAILWAY PLANNING;

LINEAR PROGRAMMING;

EID: 78649761026     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1100.0322     Document Type: Article

References (23)

1. Abdelghany, A., G. Ekollu, R. Narasimhan, K. Abdelghany. 2004. A proactive crew recovery decision support tool for commercial airlines during irregular operations. Ann. Oper. Res. 127 309-331.
2. Caprara, A., M. Fischetti, P. Toth. 1999. A heuristic method for the set covering problem. Oper. Res. 47(5) 730-743.
3. Caprara, A., L. G. Kroon, M. Monaci, M. Peeters, P. Toth. 2007. Passenger railway optimization. C. Barnhart, G. Laporte, eds. Transportation. Elsevier, Amsterdam, 129-187.
4. Desrosiers, J., M. E. Lübbecke. 2005. A primer in column generation. G. Desaulniers, J. Desrosiers, M. M. Solomon, eds. Column Generation. Springer-Verlag, New York, 1-32.
5. Fisher, M. L. 1981. The Lagrangian relaxation method for solving integer programming problems. Management Sci. 27 1-18.
6. Holmberg, K., D. Yuan. 2000. A Lagrangian heuristic-based branchand- bound approach for the capacitated network design problem. Oper. Res. 48(3) 461-481.
7. Huisman, D. 2007. A column generation approach for the rail crew re-scheduling problem. Eur. J. Oper. Res. 180 163-173.
8. Huisman, D., L. G. Kroon, R. M. Lentink, M. J. C. M. Vromans. 2005. Operations research in passenger railway transportation. Statistica Neerlandica 59 467-497.
9. Irnich, S., G. Desaulniers. 2005. Shortest path problems with resource constraints. G. Desaulniers, J. Desrosiers, M. M. Solomon, eds. Column Generation. Springer, New York, 33-65.
10. Jespersen-Groth, J., D. Potthoff, J. Clausen, D. Huisman, L. G. Kroon, G. Maróti, M. Nyhave Nielsen. 2009. Disruption management in passenger railway transportation. R. K. Ahuja, R. H. Möhring, C. D. Zaroliagis, eds. Robust and Online Large- Scale Optimization. Springer-Verlag, New York, 399-421.
11. Kroon, L. G., D. Huisman. 2009. Algorithmic support for railway disruption management. Technical Report EI 2009-50, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands.
12. Kroon, L. G., D. Huisman, E. Abbink, P.-J. Fioole, M. Fischetti, G. Maróti, L. Schrijver, A. Steenbeek, R. Ybema. 2009. The new Dutch timetable: The OR revolution. Interfaces 39 6-17.
13. Lettovský, L., E. L. Johnson, G. L. Nemhauser. 2000. Airline crew recovery. Transportation Sci. 34(4) 337-348.
14. Medard, C. P., N. Sawhney. 2007. Airline crew scheduling from planning to operations. Eur. J. Oper. Res. 183 1013-1027.
15. Nielsen, L. K. 2008. A decision support framework for rolling stock rescheduling. Technical Report ARRIVAL-TR-0158, Algorithms for Robust and online Railway optimization: Improving the Validity and reliAbility of Large scale systems (ARRIVAL).
16. Nissen, R., K. Haase. 2006. Duty-period-based network model for crew rescheduling in European airlines. J. Scheduling 9 255-278.
17. Pepin, A.-S., G. Desaulniers, A. Hertz, D. Huisman. 2009. Comparison of heuristic approaches for the multiple depot vehicle scheduling problem. J. Scheduling 12 17-30.
18. Prescott-Gagnon, E., G. Desaulniers, L.-M. Rousseau. 2009. A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54 190-204.
19. Rezanova, N. J., D. M. Ryan. 2010. The train driver recovery problem- A set partitioning based model and solution method. Comput. Oper. Res. 37(5) 845-856.
20. Ropke, S., D. Pisinger. 2006. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4) 455-472.
21. Stojkovíc, M., F. Soumis, J. Desrosiers. 1998. The operational airline crew scheduling problem. Transportation Sci. 32(3) 232-245.
22. Walker, C. G., J. N. Snowdon, D. M. Ryan. 2005. Simultaneous disruption recovery of a train timetable and crew roster in real time. Comput. Oper. Res. 32 2077-2094.
23. Yu, G., M. Argüello, G. Song, S. M. McCowan, A. White. 2003. A new era for crew recovery at continental airlines. Interfaces 33 5-22.