Abstract
Train crew rostering involves the development of a duty timetable for each of the drivers of a rail transport organization. This duty timetable is spread over a period known as the roster planning horizon. We propose an optimization approach for an instance of a train crew rostering problem arising from a practical application. The problem involves developing continuous and cyclic work lines (or rosters) for train drivers spread over several depots in a rail network. The rail timetable includes over 1300 trips a week. The rosters for all the crew must conform to complex industrial regulations and work rules. The main objective in this model is to minimize the overall roster cost accrued from using the available crew while providing the requisite number of crew for each train trip in the schedule. The rosters must also satisfy quality standards for all drivers, by attempting to satisfy their personal preferences. We describe the problem and provide optimization formulations and solution approaches. We also present some computational results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Anbari, F.T. (1987). Train and engine crew management system. Computers and Railway Operations, 267–284. Computational Mechanics Publications, Springer, Berlin.
Arabeyre, J.P., J. Fearnley, F.C. Steiger, and W. Teather (1969). The airline crew scheduling problem: A survey. Transportation Science 3, 140–163.
Barnhart, C., E.L. Johnson, R. Anbil, and L. Hatay (1994). A column generation technique for the long-haul crew assignment problem. In T.A. Ciriani and R.C. Leachman (Eds.), Optimization in Industry 2, Wiley, New York, 7–24.
Bianco, L., M. Bielli, A. Mingozzi, S. Ricciardelli, and M. Spadoni (1992). A heuristic procedure for the crew rostering problem. European Journal of Operational Research 58, 272–283.
Caprara, A., M. Fischetti, P.L. Guida, P. Toth, and D. Vigo (1999). Solution of large-scale railway crew planning problems: The Italian experience. In N.H.M. Wilson (Ed.), Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems, 471, Springer, Berlin, 1–18.
Caprara, A., M. Fischetti, P. Toth, D. Vigo, and P.L. Guida (1997). Algorithms for railway crew management. Mathematical Programming 79, 125–141.
Caprara, A., U.P. Toth, D. Vigo, and M. Fischetti (1998). Modeling and solving the crew rostering problem. Operations Research 46, 820–830.
CPLEX (2000). ILOG CPLEX 6.5 Reference Manual. ILOG Inc., CPLEX Division.
Day, P.R. and D.M. Ryan (1997). Flight attendant rostering for the shorthaul airline operations. Operations Research 45, 649–661.
Ernst, A.T., H. Jiang, M. Krishnamoorthy, H. Nott, and D. Sier (2000). An integrated optimisation model for train crew management. Technical report, CSIRO Mathematical and Information Science, Australia. Submitted to Annals of Operations Research.
Ernst, A.T., M. Krishnamoorthy, and D. Dowling (1998). Train crew rostering using simulated annealing. In Proceedings of International Conference on Optimization Techniques and Applications, 859–866.
Etschmaier, M.M. and D.F.X. Mathaisel (1985). Airline scheduling: An overview. Transportation Science 19, 127–138.
Fores, S., L. Proll, and A. Wren (1998). A column generation approach to bus driver scheduling. In M.H.G. Bell (Ed.), Transportation Networks: Recent Methodological Advances, Elsevier, Amsterdam, 195–208.
Gamache, M. and F. Soumis (1998). A method for optimally solving the rostering problem. In G. Yu (Ed.), OR in the Airline Industry, Kluwer, Boston, 124–157.
Gamache, M., F. Soumis, G. Marquis, and J. Desrosiers (1999). A column generation approach for large scale aircrew rostering problems. Operations Research 47, 247–263.
Garey, M.R. and D.S. Johnson (1979). Computers and Intractability. W.H. Freeman, New York.
Gershkoff, I. (1989). Optimizing flight crew schedules. Interfaces 19(4), 29–43.
Graves, G., R. McBride, I. Gershkoff, D. Anderson, and D. Mahidhara (1993). Flight crew scheduling. Management Science 39, 736–745.
Hoffman, K.L. and M.W. Padberg (1993). Solving airline crew scheduling problems by branch-and-cut. Management Science 39, 657–682.
Larcher, R. and M. Sinay (1982). Scheduling of railway crew for random arrivals. In Research for Tomorrow’s Transport Requirement: Proceedings of the World Conference on Transport Research, British Columbia, Canada, 1156–1161.
Mason, A.J., D.M. Ryan, and D.M. Panton (1998). Integrated simulation, heuristic and optimisation approaches to staff scheduling. Operations Research 46, 161–175.
Morgado, E.M. and J.P. Martins (1992). Scheduling and managing crew in the Portuguese railways. Expert Systems with Applications 5, 301–321.
Morgado, E.M. and J.P. Martins (1993). An AI-based approach to crew scheduling. In Proceedings of the 9th Conference on Artificial Intellegence for Applications, IEEE Computer Society Press, 71–77.
Tykulsker, R.J., K.K. O’Neil, A. Ceder, and Y. Sheffi (1985). A commuter railway crew assignment/work rules model. In J.-M. Rousseau (Ed.), Computer Scheduling of Public Transport 2, Elsevier, Amsterdam, 233–246.
Vance, P.H., C. Barnhart, E.L. Johnson, and G.L. Nemhauser (1997). Airline crew scheduling: A new formulation and decomposition algorithm. Operations Research 45, 88–200.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ernst, A., Jiang, H., Krishnamoorthy, M., Nott, H., Sier, D. (2001). Rail Crew Scheduling and Rostering Optimization Algorithms. In: Voß, S., Daduna, J.R. (eds) Computer-Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56423-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-56423-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42243-3
Online ISBN: 978-3-642-56423-9
eBook Packages: Springer Book Archive