An Integrated Approach to Extra-Urban Crew and Vehicle Scheduling*

Scheduling of vehicles and crews, traditionally performed sequentially by scheduling vehicles prior to crews, has to be carried out simultaneously in particular settings such as the ex-urban mass transit, where crews are tightly dependent on vehicles’ activity or crews’ dead-headings are highly constrained. In this paper we propose an integrated approach to vehicle and crew scheduling which exploits the network structure of the problem. A heuristic method based on Lagrangean relaxation is presented, which determines a set of pieces of work suitable for both vehicle activities as well as for crew duties. Crew duties are fixed step by step, while vehicles are scheduled once all the trips have been partitioned into pieces. Extended use is made of Bundle methods for polyhedral functions and algorithms for constrained shortest paths and assignment within a dual greedy heuristic procedure for the set partitioning problem. Computational results are provided for Italian public transit operators, which show some improvements over the results of the sequential approach.

[1]  M O Ball,et al.  A LAGRANGIAN RELAXATION BASED HEURISTIC FOR THE URBAN TRANSIT CREW SCHEDULING PROBLEM. FROM THE BOOK COMPUTER-AIDED TRANSIT SCHEDULING , 1988 .

[2]  Jochem Zowe,et al.  A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..

[3]  Roy E. Marsten,et al.  Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications , 1981, Networks.

[4]  Ann S. K. Kwan,et al.  Driver Scheduling Using Genetic Algorithms with Embedded Combinatorial Traits , 1999 .

[5]  J. Beasley.  A lagrangian heuristic for set‐covering problems , 1990 .

[6]  M. Minoux,et al.  A new approach for crew pairing problems by column generation with an application to air transportation , 1988 .

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

[8]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

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

[10]  Giorgio Gallo,et al.  Network models for vehicle and crew scheduling , 1984 .

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

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

[13]  Knut Haase,et al.  An exact algorithm for the vehicle and crew scheduling problem , 1996 .

[14]  José M. P. Paixão,et al.  Vehicle Scheduling for Public Mass Transit — An Overview , 1995 .

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

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

[17]  Jacques Desrosiers,et al.  Crew Scheduling in Air Transportation , 1998 .

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

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

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

[21]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

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

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

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

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

[26]  D. Ryan,et al.  On the integer properties of scheduling set partitioning models , 1988 .

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

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

[29]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[30]  Jacques Desrosiers,et al.  A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems , 1998 .

[31]  Anthony Wren,et al.  Greedy Genetic Algorithms, Optimizing Mutations and Bus Driver Scheduling , 1995 .

[32]  Maddalena Nonato,et al.  Applying Bundle Methods to the Optimization of Polyhedral Functions: An Applications-Oriented Development , 1995 .

[33]  Egon Balas,et al.  A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering , 1992, Oper. Res..

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