Integrated and Dynamic Vehicle and Crew Scheduling

textabstractDue to increased competition in the public transport market and the pressure on governments to cut expenses, increasing attention has been paid to cost reductions in public transportation. Since the main resources used in public transportation are vehicles and crews, producing efficient vehicle and crew schedules is an important issue. A sequential approach, i.e. vehicle scheduling followed by crew scheduling, does not guarantee an overall optimal solution. Therefore, integrated approaches are considered in this thesis. For different cases, mathematical models are presented and several algorithms are developed to solve these models. Computational tests demonstrate the quality of these algorithms. In addition to cost reductions, the reliability of the public transport services for the passengers is an important issue. The disadvantage of the traditional, static approach is that, when a delay occurs, the next trip performed by that vehicle and/or driver will often start late. Therefore, new delays can occur which may have a similar `snowball’ effect. A dynamic approach has been developed to prevent such an effect.

[1]  Celso C. Ribeiro,et al.  A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem , 1991, Oper. Res..

[2]  Gerwin A. W. Griffioen.  Technical Analysis in Financial Markets , 2003 .

[3]  Jacques Desrosiers,et al.  Crew Pairing at Air France , 1993 .

[4]  Matteo Fischetti,et al.  Crew Scheduling for Netherlands Railways: "destination: customer" , 2000 .

[5]  Warren B. Powell,et al.  Stochastic and dynamic networks and routing , 1995 .

[6]  Joachim R. Daduna,et al.  Practical Experiences Using an Interactive Optimization Procedure for Vehicle Scheduling , 1993 .

[7]  A. Löbel.  Optimale Vehicle Scheduling in Public Transit , 1997 .

[8]  Maddalena Nonato,et al.  Network Models, Lagrangean Relaxation and Subgradients Bundle Approach in Crew Scheduling Problems , 1995 .

[9]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem , 2001 .

[10]  Dimitri P. Bertsekas,et al.  A forward/reverse auction algorithm for asymmetric assignment problems , 1992, Comput. Optim. Appl..

[11]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[12]  E Tosini,et al.  AN INTERACTIVE SYSTEM FOR EXTRA-URBAN VEHICLE AND CREW SCHEDULING PROBLEMS , 1988 .

[13]  François Soumis,et al.  An Optimization Model for the Simultaneous Operational Flight and Pilot Scheduling Problem , 2001, Manag. Sci..

[14]  Jacques Desrosiers,et al.  Crew pairing for a regional carrier , 1997 .

[15]  Dennis Huisman,et al.  Applying an Integrated Approach to Vehicle and Crew Scheduling in Practice , 2000 .

[16]  Warren B. Powell,et al.  On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance , 2000, Transp. Sci..

[17]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[18]  G. Mitra,et al.  Integrated Decision Support Systems for Urban Transport Scheduling: Discussion of Implementation and Experience , 1988 .

[19]  José Vasconcelos Ferreira,et al.  Evaluating a DSS for Operational Planning in Public Transport Systems: Ten Years of Experience with the GIST System , 2001 .

[20]  Marta Mesquita,et al.  Exact algorithms for the multi-depot vehicle scheduling problem based on multicommodity network flow type formulations , 1999 .

[21]  Matteo Fischetti,et al.  Crew Scheduling for Netherlands Railways , 2000 .

[22]  Dennis Huisman,et al.  A Dynamic Approach to Vehicle Scheduling , 2001 .

[23]  Anthony Wren,et al.  Experiences with a Flexible Driver Scheduler , 2001 .

[24]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[25]  Oli B. G. Madsen,et al.  A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..

[26]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[27]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[28]  R ICHARD F RELING,et al.  Scheduling Train Crews : a case study for the Dutch Railways , 2000 .

[29]  M. Fischetti,et al.  Heuristic algorithms for the multiple depot vehicle scheduling problem , 1993 .

[30]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[31]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[32]  Albert P. M. Wagelmans,et al.  Models and Algorithms for Single-Depot Vehicle Scheduling , 2001, Transp. Sci..

[33]  Michel Gendreau,et al.  Diversion Issues in Real-Time Vehicle Dispatching , 2000, Transp. Sci..

[34]  Matteo Fischetti,et al.  A Heuristic Algorithm for the Set Covering Problem , 1996, IPCO.

[35]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[36]  R. Kraut,et al.  Vehicle scheduling in public transit and Lagrangean pricing , 1998 .

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

[38]  M. F.,et al.  Bibliography , 1985, Experimental Gerontology.

[39]  G. Laporte,et al.  Solving Stochastic Routing Problems with the Integer L-Shaped Method , 1998 .

[40]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[41]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[42]  D Dupuis.  HASTUS--AN INTERACTIVE SYSTEM FOR BUSES AND CREW SCHEDULING , 1986 .

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

[44]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[45]  Lawrence Bodin,et al.  A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles , 1983 .

[46]  Alan A. Bertossi,et al.  On some matching problems arising in vehicle scheduling models , 1987, Networks.

[47]  Ioannis Patrikalakis,et al.  A New Decomposition Scheme of the Urban Public Transport Scheduling Problem , 1992 .

[48]  Michael Forbes,et al.  An exact algorithm for multiple depot bus scheduling , 1994 .

[49]  G. Nemhauser,et al.  Integer Programming , 2020 .

[50]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

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

[52]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[53]  D. I. Calvert,et al.  Computer Scheduling of Public Transport 2 , 1986 .

[54]  Martin Desrochers,et al.  A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..

[55]  G. Mitra,et al.  Computer Scheduling of Public Transport , 1982 .

[56]  Jean-François Cordeau,et al.  Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling , 2000, Transp. Sci..

[57]  Albert P. M. Wagelmans,et al.  An Overview of Models and Techniques for Integrating Vehicle and Crew Scheduling , 1997 .

[58]  Marco A. Boschetti,et al.  A Set Partitioning Approach to the Crew Scheduling Problem , 1999, Oper. Res..

[59]  M. V. Riel,et al.  Crew Scheduling for Netherlands Railways “ Destination : Customer ” , 2000 .

[60]  D. M. Ryan,et al.  Express: Set Partitioning for Bus Crew Scheduling in Christchurch , 1992 .

[61]  Matteo Fischetti,et al.  Solution of Large-Scale Railway Crew Planning Problems: the Italian Experience , 1999 .

[62]  Matteo Fischetti,et al.  The Fixed Job Schedule Problem with Working-Time Constraints , 1989, Oper. Res..

[63]  李幼升,et al.  Ph , 1989 .

[64]  Matteo Fischetti,et al.  The Fixed Job Schedule Problem with Spread-Time Constraints , 1987, Oper. Res..