Abstract
The railway crew scheduling problem is to determine an optimal crew assignment for the railway timetable data by minimizing the required number of crew members in order to satisfy the set covering constraints. Column generation is one of the optimization methods that can solve the problem efficiently. In order to improve the convergence of column generation, we propose dual inequalities for a Dantzig-Wolfe decomposition of railway crew scheduling problems to reduce the number of replications in the column generation procedure. The dual inequalities are generated from the characteristic of the given railway timetable data. Computational results demonstrate the effectiveness of the proposed method compared with the conventional column generation for an actual railway timetable data.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Abbink E, Fischetti M, Kroon L, Timmer G, Vromans M (2005) Reinventing crew scheduling at Netherlands railways. Interfaces 35(5):393–401
Akker M, Hoogeveen H, Velde S (2002) Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem. INFORMS J Comput 14(1):37–51
Alves C, Carvalho JMV (2007) Accelerating column generation for variable sized bin-packing problems. Eur J Oper Res 183(3):1333–1352
Baldacci R, Maniezzo V, Mingozzi A (2004) An exact method for the car pooling problem based on Lagrangean column generation. Oper Res 52(3):422–439
Bunte S, Kliewer N (2009) An overview on vehicle scheduling models. Public Transp 1(4):299–317
Caprara A, Fischetti M, Toth P (1999) A heuristic method for the set covering problem. Oper Res 47(5):730–743
Chu SCK, Chan ECH (1998) Crew scheduling of light rail transit in Hong Kong: from modeling to implementation. Comput Oper Res 25(11):887–894
Desrochers M, Soumis F (1989) A column generation approach to the urban transit crew scheduling problem. Transp Sci 23(1):1–13
Desrosiers J, Soumis F, Desrochers M (1984) Routing with time window by column generation. Networks 14(4):545–565
Du Merle O, Villeuve D, Desrosiers J (1999) Stabilized column generation. Discrete Math 194:229–237
Hartog A, Huisman D, Abbink E, Kroon L (2009) Decision support for crew rostering at NS. Public Transp 1(2):121–133
Huisman D (2007) A column generation approach for the rail crew re-scheduling problem. Eur J Oper Res 180(1):163–173
Huisman D, Jans R, Peeters M, Wagelmans APM (2003) Combining column generation and Lagrangian relaxation. ERIM report series reference no ERS-2003-092-LIS
Kohl N (2003) Solving the world’s largest crew scheduling problem. ORbit 8–12
Kroon LG, Fischetti M (2001) Crew scheduling for Netherlands railways destination: customer. Computer-aided scheduling of public transport. Springer, Berlin, pp 181–201
Sarac A, Batta R, Rump CM (2006) A branch-and-price approach for operational aircraft maintenance routing. Eur J Oper Res 175(3):1850–1869
Vanderbeck F (1999) Computational study of a column generation algorithm for bin packing and cutting stock problems. Math Program A86:565–594
Valério de Carvalho JM (2005) Using extra dual cuts to accelerate column generation. INFORMS J Comput 17(2):175–182
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Nishi, T., Muroi, Y. & Inuiguchi, M. Column generation with dual inequalities for railway crew scheduling problems. Public Transp 3, 25–42 (2011). https://doi.org/10.1007/s12469-011-0037-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12469-011-0037-x