Abstract
Crew scheduling is a very well known problem which has been historically associated with airlines and mass transit companies; recently railway applications have also come on the scene. This is especially true in Europe, where deregulation and privatization edicts are forcing a re-organization of the rail industry and better productivity and more efficient services are strongly required by the market and the public. Therefore, this sector is showing increasing interest in Operations Research and Management Science. Railway crew planning represents a hard problem due to both the dimensions and the operational/regulation constraints involved. This paper describes the development of a new crew planning system set up by Ferrovie dello Stato SpA (the Italian railway company) in co-operation with the University of Bologna.
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.
Similar content being viewed by others
References
Balakrishnan, N./Wong, R.T. (1990): A network model for the rotating workforce scheduling problem. in: Networks 20, 25–42.
Balas, E./Carrera, M.C. (1996): A dynamic subgradient-based branch-and-bound procedure for set covering. in: Operations Research 44, 875–890.
Balas, E./Ho, A. (1980): Set covering algorithms using cutting planes, heuristics and subgradient optimization: a computational study. in: Mathematical Programming Study 12, 37–60.
Barnhart, C./Johnson, E.L./Nemhauser, G.L./ Savelsbergh, M.W.P./ Vance, P.H. (1994): Branch-and-price: column generation for solving huge integer programs, in: Birge, J.R./Murty, K.G. (eds.): Mathematical Programming: State of the Art 1994, 186–207. (The University of Michigan Press) Ann Arbor.
Beasley, J.E. (1987): An algorithm for set covering problems. in: European Journal of Operational Research 31, 85–93.
Beasley, J.E. (1990): A lagrangian heuristic for set covering problems. in: Naval Research Logistics 37, 151–164.
Beasley, J.E./Chu, P.C. (1996): A genetic algorithm for the set covering problem. in: European Journal of Operational Research 94, 392–404.
Beasley, J.E./Jörnsten, K. (1992): Enhancing an algorithm for set covering problems. in: European Journal of Operational Research 58, 293–300.
Bianco, L./Bielli, M./Mingozzi, A./Ricciardelli, S./Spadoni, M. (1992): A heuristic procedure for the crew rostering problem. in: European Journal of Operational Research 58, 272–283.
Bodin, L./Golden, B./ Assad, A./Ball, M. (1983): Routing and scheduling of vehicles and crews: the state of the art. in: Computers and Operations Research 10, 63–211.
Caprara, A./Fischetti, M./Toth, P. (1995): A heuristic method for the set covering problem. Technical report OR-95–8, DEIS University of Bologna. Extended abstract published in Cunningham, W.H./McCormick, S.T./Queyranne, M. (eds.): Proceedings of the Fifth IPCO Conference, Lecture Notes in Computer Science 1084, 72–84. (Springer) Berlin.
Caprara, A./Fischetti, M./Toth, P./Vigo, D. (1995): Modeling and solving the crew rostering problem. Technical report OR-95–6, DEIS University of Bologna. To appear in Operations Research.
Carraresi, P./Gallo, G. (1984a): Network models for vehicle and crew scheduling. in: European Journal of Operational Research 16, 139–151.
Carraresi, P./Gallo, G. (1984b): A multilevel bottleneck assignment approach to the bus drivers’ rostering problem. in: European Journal of Operational Research 16, 163–173.
Ceria, S./Nobili, P./Sassano, A. (1995): A lagrangian-based heuristic for large-scale set covering problems. Technical report R.406, IASI-CNR, Rome. To appear in Mathematical Programming.
Daduna, J.R./Wren, A. (eds.) (1988): Computer-Aided Transit Scheduling. Lecture Notes in Economic and Mathematical Systems 308. (Springer) Berlin.
Desrochers, M./Rousseau, J.-M. (eds.) (1992): Computer-Aided Transit Scheduling. Lecture Notes in Economic and Mathematical Systems 386. (Springer) Berlin.
Desrosiers, J./Dumas, Y./Solomon, M.M./Soumis, F. (1995): Time constrained routing and scheduling. in: Ball, M.O./Magnanti, T.L./Monma, C.L./Nemhauser, G.L. (eds.): Handbooks in OR & MS, Vol. 8, 35–139. (Elsevier) Amsterdam.
Fisher, M.L./Kedia, P. (1990): Optimal solutions of set covering/ partitioning problems using dual heuristics. in: Management Science 36, 674–688.
Gamache, M./Soumis, F. (1993): A method for optimally solving the rostering problem. Les Cahiers du GERAD G-93–40. Montréal.
Gamache, M./Soumis, F./Marquis, G./Desrosiers, J. (1994): A column generation approach for large scale aircrew rostering problems. Les Cahiers du GERAD G-94–20. Montrèal.
Hagberg, B. (1985): An assignment approach to the rostering problem. in: Rousseau, J.-M. (ed.): Computer Scheduling of Public Transport 2. (North Holland) Amsterdam.
Jachnik, J.K. (1981): Attendance and rostering systems. in: Wren, A. (ed.): Computer Scheduling of Public Transport. (North Holland) Amsterdam.
Jacobs, L.W./Brusco, M.J. (1995): A local search heuristic for large set-covering problems. in: Naval Research Logistics 52, 1129–1140.
Jarrah, A.I.Z./Diamond, J.T. (1995): The crew bidline generation problem. Technical Report, SABRE Decision Technologies.
Lorena, L.A.N./Lopes, F.B. (1994): A surrogate heuristic for set covering problems. in: European Journal of Operational Research 79, 138–150.
Rousseau, J.-M. (ed.) (1985): Computer Scheduling of Public Transport 2. (North Holland) Amsterdam.
Ryan, D.M. (1992): The solution of massive generalized set partitioning problems in aircrew rostering. in: Journal of the Operational Research Society 43, 459–467.
Tien, J.M./Kamiyama, A. (1982): On manpower scheduling algorithms. in: SIAM Review 24, 275–287.
Wedelin, D. (1995): An algorithm for large scale 0–1 integer programming with application to airline crew scheduling. in: Annals of Operations Research 57, 283–301.
Wren, A. (ed.) (1981): Computer scheduling of public transport. (North Holland) Amsterdam.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caprara, A., Fischetti, M., Guida, P.L., Toth, P., Vigo, D. (1999). Solution of Large-Scale Railway Crew Planning Problems: the Italian Experience. In: Wilson, N.H.M. (eds) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85970-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-85970-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65775-0
Online ISBN: 978-3-642-85970-0
eBook Packages: Springer Book Archive