Abstract
Given a set of timetabled bus trips, transport companies are faced with the challenge of finding a feasible driver schedule that covers all trips and abides by various labor union regulations. The regulations are primarily concerned with providing sufficient breaks for the drivers during the day. Practical limitations in the city network enforce drivers to travel by cars between bus stops to have breaks. Transport companies have a limited number of cars, known as staff cars, which have to be returned to their respective depots at the end of the day. The simultaneous scheduling of drivers and staff cars for the drivers is known as the driver scheduling problem with staff cars (DSPSC). It is estimated that the DSPSC accounts for 60% of a bus company’s operational expense, and this paper proposes a column generation approach that attempts to minimize operational expense. The column-generation framework iterates between a master problem, a subproblem for generating driver variables and a subproblem for generating staff car variables. The subproblem related to the drivers is formulated as a resource constrained shortest path problem, which is solved by a dynamic programming approach. Several heuristic branching strategies are explored to find integer solutions. The proposed methodology is tested on eight real-life instances from seven Northern European bus companies. A comparison with a state-of-the-art mixed integer programming (MIP) solver and an adaptive large neighborhood search (ALNS) heuristic indicate that the column generation approach provides improved solutions for six instances and the average improvement is 1.45%.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
According to CPUbenchmark, the overall CPU rating of the processor used for the MIP solver is 15752 while that of the matheuristic is 4681.
References
Achterberg T, Wunderling R (2013) Mixed Integer Programming: Analyzing 12 Years of Progress. In: Facets of Combinatorial Optimization, Springer, Berlin, Heidelberg, pp 449–481. https://doi.org/10.1007/978-3-642-38189-8_18
Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: column generation for solving huge integer programs. Operat Res 46(3):316–329. https://doi.org/10.1287/opre.46.3.316
Bixby R, Rothberg E (2007) Progress in computational mixed integer programming—a look back from the other side of the tipping point. Ann Operat Res 149(1):37–41. https://doi.org/10.1007/s10479-006-0091-y
Borndörfer R, Löbel A, Weider S (2008) A bundle method for integrated multi-depot vehicle and duty scheduling in public transit. Lecture Notes Econ Math Syst 600:3–24. https://doi.org/10.1007/978-3-540-73312-6_1
Boschetti MA, Maniezzo V, Roffilli M, Bolufé Röhler A (2009) Matheuristics: optimization, simulation and control. Lecture Notes Comput Sci 5818:171–177. https://doi.org/10.1007/978-3-642-04918-7_13
Cordeau JF, Stojković G, Soumis F, Desrosiers J (2001) Benders decomposition for simultaneous aircraft routing and crew scheduling. Transport Sci 35(4):375–388. https://doi.org/10.1287/trsc.35.4.375.10432
Desaulniers G, Lavigne J, Soumis F (1998) Multi-depot vehicle scheduling problems with time windows and waiting costs. Eur J Operat Res 111(3):479–494. https://doi.org/10.1016/S0377-2217(97)00363-9
Desrochers M, Soumis F (1989) A column generation approach to the Urban transit crew scheduling problem. Transport Sci 23(1):1–13. https://doi.org/10.1287/trsc.23.1.1
Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Operat Res 40(2):342–354. https://doi.org/10.1287/opre.40.2.342
Desrosiers J, Soumis F, Desrochers M (1984) Routing with time windows by column generation. Networks 14(4):545–565. https://doi.org/10.1002/net.3230140406
Dror M (1994) Note on the complexity of the shortest path models for column generation in VRPTW. Operat Res 42(5):977–978. https://doi.org/10.1287/opre.42.5.977
Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3):216–229. https://doi.org/10.1002/net.20033
Fischetti M, Martello S, Toth P (1987) The fixed job schedule problem with spread-time constraints. Operat Res 35(6):849–858. https://doi.org/10.1287/opre.35.6.849
Freling R, Huisman D, Wagelmans AP (2003) Models and algorithms for integration of vehicle and crew scheduling. J Schedul 6(1):63–85. https://doi.org/10.1023/A:1022287504028
Friberg C, Haase K (1999) An exact algorithm for the vehicle and crew scheduling problem. Computer Aided Transit Scheduling 471(416):63–80
Hadjar A, Marcotte O, Soumis F (2006) A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. Operat Res 54(1):130–149. https://doi.org/10.1287/opre.1050.0240
Huisman D, Freling R, Wagelmans APM (2005) Multiple-depot integrated vehicle and crew scheduling. Transportation Science 39(4):491–502. https://doi.org/10.1287/trsc.1040.0104
Ibarra-Rojas OJ, Delgado F, Giesen R, Muñoz JC (2015) Planning, operation, and control of bus transport systems: a literature review. Transport Res B 77:38–75. https://doi.org/10.1016/j.trb.2015.03.002
Irnich S (2007) Resource extension functions: properties, inversion, and generalization to segments. OR Spectrum 30(1):113–148. https://doi.org/10.1007/s00291-007-0083-6
Irnich S, Desaulniers G (2005) Shortest Path Problems with Resource Constraints. In: Column Generation, vol 48, Springer, New York, pp 33–65, https://doi.org/10.1007/0-387-25486-2_2
Kliewer N, Amberg B, Amberg B (2012) Multiple depot vehicle and crew scheduling with time windows for scheduled trips. Public Transport 3(3):213–244. https://doi.org/10.1007/s12469-011-0049-6
Li H, Wang Y, Li S, Li S (2015) A column generation based hyper-heuristic to the bus driver scheduling problem. Discrete Dyn Nat Soc 2015:1–10. https://doi.org/10.1155/2015/638104
Li J, Kwan R (2003) A fuzzy genetic algorithm for driver scheduling. Eur J Operat Res 147(2):334–344. https://doi.org/10.1016/S0377-2217(02)00564-7
Lourenço HR, Paixão JP, Portugal R (2001) Multiobjective metaheuristics for the bus driver scheduling problem. Transport Sci 35(3):331–343. https://doi.org/10.1287/trsc.35.3.331.10147
Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Operat Res 53(6):1007–1023. https://doi.org/10.1287/opre.1050.0234
Mauri G, Lorena L (2007) A new hybrid heuristic for driver scheduling. Int J Hybrid Intell Syst 4(1):39–47. https://doi.org/10.3233/HIS-2007-4105
Mercier A, Cordeau JF, Soumis F (2005) A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. Comput Operat Res 32(6):1451–1476. https://doi.org/10.1016/j.cor.2003.11.013
Pepin AS, Desaulniers G, Hertz A, Huisman D (2009) A comparison of five heuristics for the multiple depot vehicle scheduling problem. J Schedul 12(1):17–30. https://doi.org/10.1007/s10951-008-0072-x
Perumal SS, Larsen J, Lusby RM, Riis M, Sørensen KS (2019) A matheuristic for the driver scheduling problem with staff cars. Eur J Operat Res 275(1):280–294. https://doi.org/10.1016/j.ejor.2018.11.011
Portugal R, Lourenço HR, Paixão JP (2009) Driver scheduling problem modelling. Public Transport 1(2):103–120. https://doi.org/10.1007/s12469-008-0007-0
Pugliese LDP, Guerriero F (2013) A survey of resource constrained shortest path problems: exact solution approaches. Networks 62(3):183–200. https://doi.org/10.1002/net.21511
Ryan DM, Foster BA (1981) An integer programming approach to scheduling. Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling Proceedings of an International Workshop
Smith BM, Wren A (1988) A bus crew scheduling system using a set covering formulation. Transport Res A 22(2):97–108. https://doi.org/10.1016/0191-2607(88)90022-2
Smith OJ, Boland N, Waterer H (2012) Solving shortest path problems with a weight constraint and replenishment arcs. Comput Operat Res 39(5):964–984. https://doi.org/10.1016/j.cor.2011.07.017
Steinzen I (2007) Topics in Integrated Vehicle and Crew Scheduling in Public Transport. PhD thesis, University of Paderborn, Germany
Wren A, Fores S, Kwan A, Kwan R, Parker M, Proll L (2003) A flexible system for scheduling drivers. J Schedul 6(5):437–455. https://doi.org/10.1023/A:1024854522373
Yunes TH, Moura AV, de Souza CC (2005) Hybrid column generation approaches for Urban transit crew management problems. Transport Sci 39(2):273–288. https://doi.org/10.1287/trsc.1030.0078
Acknowledgements
This work was supported by the Innovation Fund Denmark [grant number 5189-00128B]. The authors would like to thank Kasper S. Sørensen from Trapeze Group Europe A/S for providing the instances from the seven Northern-European transport companies. The authors would also like to thank the two anonymous referees for their valuable suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Perumal, S.S.G., Larsen, J., Lusby, R.M. et al. A column generation approach for the driver scheduling problem with staff cars. Public Transp 14, 705–738 (2022). https://doi.org/10.1007/s12469-021-00279-9
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12469-021-00279-9