Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models

Published Online:https://doi.org/10.1287/opre.2021.2155

References

  • Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms and Applications (Prentice-Hall, Hoboken, NJ).Google Scholar
  • Amberg B, Amberg B, Kliewer N (2019) Robust efficiency in urban public transportation: Minimizing delay propagation in cost-efficient bus and driver schedules. Transportation Sci. 53(1):89–112.LinkGoogle Scholar
  • Atamtürk A, Nemhauser GL, Savelsbergh MWP (2000) Conflict graphs in solving integer programming problems. Eur. J. Oper. Res. 121(1):40–55.CrossrefGoogle Scholar
  • Balakrishnan A, Li G, Mirchandani P (2017) Optimal network design with end-to-end service requirements. Oper. Res. 65(3):729–750.LinkGoogle Scholar
  • Balakrishnan A, Magnanti TL, Mirchandani P, Wong RT (2021) Network design with routing restrictions. Crainic TG, Gendreau, M, Gendron B, eds. Network Design with Applications to Transportation and Logistics (Springer, Heidelberg), 209–253.CrossrefGoogle Scholar
  • Beasley JE, Cao B (1996) A tree search algorithm for the crew scheduling problem. Eur. J. Oper. Res. 94:517–526.CrossrefGoogle Scholar
  • Beasley JE, Cao B (1998) A dynamic programming-based algorithm for the crew scheduling problem. Comput. Oper. Res. 25:567–582.CrossrefGoogle Scholar
  • Bianco L, Mingozzi A, Ricciardelli S (1994) A set partitioning approach to the multiple depot vehicle scheduling problem. Optim. Methods Software 3(1-3):163–194.CrossrefGoogle Scholar
  • Boschetti MA, Mingozzi A, Ricciardelli S (2004) An exact algorithm for the simplified multiple depot crew scheduling problem. Ann. Oper. Res. 127:177–201.CrossrefGoogle Scholar
  • Cappanera P, Gallo G (2004) A multicommodity flow approach to the crew rostering problem. Oper. Res. 52(4):583–596.LinkGoogle Scholar
  • Caprara A, Toth P, Vigo D, Fischetti M (1998) Modeling and solving the crew rostering problem. Oper. Res. 46(6):820–830.LinkGoogle Scholar
  • Desrochers M, Soumis F (1989) A column generation approach to the urban transit crew scheduling problem. Transportation Sci. 23(1):1–13.LinkGoogle Scholar
  • Desaulniers G, Hickman MD (2007) Public transit. Barnhart C, Laporte G, eds. Handbooks in OR & MS: Transportation, vol. 14. (Elsevier, Amsterdam), 69–127.Google Scholar
  • Ernst AT, Jiang H, Krishnamoorthy M, Sier D (2004a) Staff scheduling and rostering: A review of applications, methods, and models. Eur. J. Oper. Res. 153:3–27.CrossrefGoogle Scholar
  • Ernst AT, Jiang H, Krishnamoorthy M, Owens B, Sier D (2004b) An annotated bibliography of personnel scheduling and rostering. Ann. Oper. Res. 127(1-4):21–144.CrossrefGoogle Scholar
  • Fischetti M, Martello S, Toth P (1987) The fixed job schedule problem with spread-time constraints. Oper. Res. 35(6):849–858.LinkGoogle Scholar
  • Fischetti M, Martello S, Toth P (1989) The fixed job schedule problem with working-time constraints. Oper. Res. 37(3):395–403.LinkGoogle Scholar
  • Fischetti M, Lodi A, Martello S, Toth P (2001) A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Sci. 47(6):833–850.LinkGoogle Scholar
  • Groiez M, Desaulniers G, Hadjar A, Marcotte O (2013) Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem. EURO J. Comput. Optim. 1:283–312.CrossrefGoogle Scholar
  • Hadjar A, Marcotte O, Soumis F (2006) A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. Oper. Res. 54(1):130–149.LinkGoogle Scholar
  • Ibarra-Rojas OJ, Delgado F, Giesen R, Muñoz JC (2015) Planning, operation, and control of bus transport systems: A literature review. Transportation Res. Part B: Methodological 77:38–75.CrossrefGoogle Scholar
  • Lahyani R, Khemakhem M, Semet F (2015) Rich vehicle routing problems: From a taxonomy to a definition. Eur. J. Oper. Res. 241:1–14.CrossrefGoogle Scholar
  • Löbel A (1998) Vehicle scheduling in public transit and Lagrangian pricing. Management Sci. 44(12-part-1):1637–1649.LinkGoogle Scholar
  • Mingozzi A, Boschetti MA, Ricciardelli S, Bianco L (1999) A set partitioning approach to the crew scheduling problem. Oper. Res. 47(6):873–888.LinkGoogle Scholar
  • Rodrigues MM, de Souza CC, Moura AV (2006) Vehicle and crew scheduling for urban bus lines. Eur. J. Oper. Res. 170:844–862.CrossrefGoogle Scholar
  • Wolsey LA, Nemhauser GL (1999) Integer and Combinatorial Optimization (John Wiley & Sons, Hoboken, NJ).Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.