A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems

Crew and vehicle scheduling are fundamental issues in public transit management. Informally, they can be described as the problem of determining the optimal duties for a set of crews e.g., bus drivers or vehicles e.g., buses so as to cover a given set of timetabled trips, satisfying a number of constraints laid down by the union contract and company regulations. We consider the simplified but still NP-hard case in which several depots are specified, and limits on both the total time between the start and the end of any duty spread time and the total duty operational time working time are imposed. We give a 0-1 linear programming formulation based on binary variables associated with trip transitions, which applies to both crew and vehicle scheduling. The model is enhanced by means of new families of valid inequalities, for which exact and heuristic separation procedures are proposed. These techniques are embedded into an exact branch-and-cut algorithm, which also incorporates heuristic procedures. The performance of two implementations of the method for vehicle scheduling and crew scheduling, respectively are evaluated through computational testing on both random and real-world test problems from the literature.

[1]  Daniele Vigo,et al.  Approximation algorithms for the oriented two-dimensional bin packing problem , 1999, Eur. J. Oper. Res..

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

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

[4]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[5]  M. Grötschel,et al.  A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000 .

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

[7]  Jacques Desrosiers,et al.  Stabilisation dans le cadre de la génération de colonnes , 1997 .

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

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

[10]  Abilio Lucena,et al.  Branch and cut algorithms , 1996 .

[11]  Matteo Fischetti,et al.  A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000, Networks.

[12]  Jacques Desrosiers,et al.  Chapter 2 Time constrained routing and scheduling , 1995 .

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

[14]  S. N. Maheshwari,et al.  Analysis of Preflow Push Algorithms for Maximum Network Flow , 1988, FSTTCS.

[15]  Paolo Toth,et al.  Algorithms and codes for the assignment problem , 1988 .

[16]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

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

[18]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

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

[20]  Matteo Fischetti,et al.  A Polyhedral Approach to the Asymmetric Traveling Salesman Problem , 1997 .

[21]  L. Bianco,et al.  A set partitioning approach to the multiple depot vehicle scheduling problem , 1994 .

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

[23]  François Soumis,et al.  Decomposition and Column Generation , 1997 .

[24]  John E. Beasley,et al.  A dynamic programming based algorithm for the crew scheduling problem , 1998, Comput. Oper. Res..

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

[26]  Noga Alon,et al.  Generating Pseudo-Random Permutations and Maximum Flow Algorithms , 1990, Inf. Process. Lett..

[27]  J. Beasley,et al.  A tree search algorithm for the crew scheduling problem , 1996 .