A dual strategy for solving the linear programming relaxation of a driver scheduling system

A Mathematical Programming model of a driver scheduling system is described. This consists of set covering and partitioning constraints, possibly user-supplied side constraints, and two pre-emptively ordered objectives. The previous solution strategy addressed the two objectives using separate Primal Simplex optimisations; a new strategy uses a single weighted objective function and a Dual Simplex algorithm initiated by a specially developed heuristic. Computational results are reported.

[1]  R. E. Marsten.  An Algorithm for Large Set Partitioning Problems , 1974 .

[2]  Anthony Wren,et al.  Experiences with a Crew Scheduling System Based on Set Covering , 1988 .

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

[4]  James P. Ignizio,et al.  An enhanced conversion scheme for lexicographic, multiobjective integer programs , 1984 .

[5]  Raymond S. K. Kwan,et al.  Driver Scheduling Using Intelligent Estimation Techniques with Heuristic Searches , 1992 .

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

[7]  Donald Goldfarb,et al.  Steepest-edge simplex algorithms for linear programming , 1992, Math. Program..

[8]  Barbara M. Smith,et al.  Impacs - A bus crew scheduling system using integer programming , 1988, Math. Program..

[9]  P. Wolfe.  A Technique for Resolving Degeneracy in Linear Programming , 1963 .

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

[11]  Robert E. Bixby,et al.  Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods , 1992, Oper. Res..

[12]  Eric Gelman,et al.  Recent Advances in Crew-Pairing Optimization at American Airlines , 1991 .

[13]  M. V. Pato,et al.  A structural lagrangean relaxation for two-duty period bus driver scheduling problems , 1989 .

[14]  Anthony Wren,et al.  A bus crew scheduling system using a set covering formulation , 1988 .

[15]  Hanif D. Sherali,et al.  Equivalent weights for lexicographic multi-objective programs: Characterizations and computations , 1982 .

[16]  Donald Goldfarb,et al.  A practicable steepest-edge simplex algorithm , 1977, Math. Program..

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

[18]  Nigel Hamer,et al.  The HASTUS System: New Algorithms and Modules for the 90s , 1992 .

[19]  Barbara M. Smith.  Bus crew scheduling using mathematical programming , 1986 .

[20]  John E. Beasley,et al.  Linear Programming on Cray Supercomputers , 1990 .

[21]  D. M. Ryan,et al.  On the solution of highly degenerate linear programmes , 1988, Math. Program..

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