Branching approaches for integrated vehicle and crew scheduling

[1]  Andrzej Jaszkiewicz,et al.  Advanced OR and AI methods in transportation , 2009, Eur. J. Oper. Res..

[2]  Marta Mesquita,et al.  Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem , 2008, Comput. Oper. Res..

[3]  Mark Hickman,et al.  Computer-aided Systems in Public Transport , 2008 .

[4]  Ralf Borndörfer,et al.  A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit , 2008 .

[5]  Leena Suhl,et al.  A Crew Scheduling Approach for Public Transit Enhanced with Aspects from Vehicle Scheduling , 2008 .

[6]  Dennis Huisman,et al.  Multiple-Depot Integrated Vehicle and Crew Scheduling , 2003, Transp. Sci..

[7]  L. Suhl,et al.  A VARIABLE FIXING HEURISTIC FOR THE MULTIPLE-DEPOT INTEGRATED VEHICLE AND CREW SCHEDULING PROBLEM , 2005 .

[8]  Efthymios Housos,et al.  Combined bus and driver scheduling , 2002, Comput. Oper. Res..

[9]  Jacques Desrosiers,et al.  Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems , 1998, Transp. Sci..

[10]  Knut Haase,et al.  An Exact Branch and Cut Algorithm for the Vehicle and Crew Scheduling Problem , 1999 .

[11]  Maddalena Nonato,et al.  An Integrated Approach to Extra-Urban Crew and Vehicle Scheduling* , 1998 .

[12]  Martin Desrochers,et al.  Computer-Aided Transit Scheduling , 1992 .

[13]  José M. P. Paixão,et al.  Multiple Depot Vehicle Scheduling Problem: A New Heuristic Based on Quasi-Assignment Algorithms , 1992 .