Reinventing Crew Scheduling at Netherlands Railways

References

• Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46(3):316–329Link, Google Scholar
• Caprara A., Fischetti M., Toth P. A heuristic method for the set-covering problem. Oper. Res. (1999b) 47(5):730–743Link, Google Scholar
• Caprara A., Fischetti M., Guida P. L., Toth P., Vigo D., Wilson N. H. M. Solution of large scale railway crew planning problems: The Italian experience. Computer Aided Transit Scheduling (1999a) (Springer-Verlag, Berlin, Germany) 1–18Crossref, Google Scholar
• Caprara A., Fischetti M., Toth P., Vigo D., Guida P. L. Algorithms for railway crew management. Math. Programming (1997) 79(1–3):125–141Crossref, Google Scholar
• Desrosiers J., Dumas Y., Solomon M. M., Soumis F., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Time constrained routing and scheduling. Network Routing, Handbooks in OR and MS (1995) 8(Elsevier Science Publishers, Amsterdam, The Netherlands) 35–139Crossref, Google Scholar
• Hoffmann K. L., Padberg M. W. Solving airline crew scheduling problems by branch-and-cut. Management Sci. (1993) 39(6):657–682Link, Google Scholar
• Kohl N. Solving the world’s largest crew scheduling problem. ORbit Extra, Newsletter Danish Oper. Res. Soc. (2003) 4(Special Issue, August):8–12Google Scholar
• Kroon L. G., Fischetti M., Daduna J., Voss S. Crew scheduling for Netherlands Railways: “Destination: customer”. Computer Aided Scheduling of Public Transport (2001) (Springer-Verlag, Berlin, Germany) 181–201Crossref, Google Scholar
• Kwan A. S. K., Kwan R. S. K., Parker M. E., Wren A., Wilson N. H. M. Producing train driver crew schedules under different operating strategies. Computer Aided Transit Scheduling (1999) (Springer-Verlag, Berlin, Germany) 129–154Crossref, Google Scholar
• Wedelin D. An algorithm for large scale 0–1 integer programming with application to airline crew scheduling. Ann. Oper. Res. (1995) 57:283–301Crossref, Google Scholar