Skip to main content
SpringerLink
Log in

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

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.R. Daduna and A. Wren (eds.), Computer-aided transit scheduling,Proc. 4th Int. Workshop on Computer-Aided Scheduling of Public Transport (Springer, 1988).

  2. M. Desrochers and J.-M. Rousseau (eds.), Computer-aided transit scheduling,Proc. 5th Int. Workshop on Computer-Aided Scheduling of Public Transport (Springer, 1992).

  3. N. Hamer and L. Seguin, The HASTUS system; new algorithms and modules for the 90s, in:Proc. 5th Int. Workshop on Computer-Aided Scheduling of Public Transport, ed. M. Desrochers and J.-M Rousseau (Springer, 1992) pp. 17–29.

  4. A. Wren and B.M. Smith, Experiences with a crew scheduling system using set covering, in:Proc. 4th Int. Workshop on Computer-Aided Scheduling of Public Transport, ed. J.R. Daduna and A. Wren (Springer, 1988) pp. 104–118.

  5. R. Anbil, E. Gilman, B. Patty and R. Tanga, Recent advances in crew-pairing optimization at American airlines, Interfaces 21(1991)62–74.

    Google Scholar 

  6. J.C. Falkner and D.M. Ryan, EXPRESS: set partitioning for bus crew scheduling in Christchurch, in:Proc. 5th Int. Workshop on Computer-Aided Scheduling of Public Transport, ed. M. Desrochers and J.-M. Rousseau (Springer, 1992) pp. 359–378.

  7. S. Lavoie, M. Minoux and E. Odier, A new approach for crew pairing problems by column generation with an application to air transportation, Euro. J. Oper. Res. 35(1988)45–58.

    Google Scholar 

  8. J. Paixão and M. Pato, A structural Lagrangian relaxation for two-duty period bus driver scheduling problems, Euro. J. Oper. Res. 39(1989)213–222.

    Google Scholar 

  9. B.M. Smith and A. Wren, A bus crew scheduling system using a set covering formulation, Transp. Res. 22A(1988)97–108.

    Google Scholar 

  10. B.M. Smith, Bus crew scheduling using mathematical programming, Ph.D. Thesis, University of Leeds (1986).

  11. D.M. Ryan, ZIP — a zero-one integer programming package for scheduling, Report CSS-85, AERE, Harwell, Oxfordshire (1980).

    Google Scholar 

  12. D. Goldfarb and J.K. Reid, A practicable steepest edge simplex algorithm, Math. Progr. 4(1977)361–371.

    Google Scholar 

  13. R.E. Bixby, J.W. Gregory, I.J. Lustig, R.E. Marsten and D.F. Shanno, Very large-scale linear programming: a case study in combining interior point and simplex methods, Oper. Res. 40(1992)885–897.

    Google Scholar 

  14. J.J. Forrest and D. Goldfarb, Steepest edge simplex algorithms for linear programming, Math. Progr. 57(1992)341–374.

    Google Scholar 

  15. B.M. Smith, IMPACS — a bus crew scheduling system using integer programming, Math. Progr. 42(1988)181–187.

    Google Scholar 

  16. D.M. Ryan and M.R. Osborne, On the solution of high degenerate linear programmes, Math. Progr. 41(1988)385–392.

    Google Scholar 

  17. P. Wolfe, A technique for resolving degeneracy in linear programming, SIAM J. 11(1963)205–211.

    Google Scholar 

  18. H.D. Sherali, Equivalent weights for lexicographic multi-objective programs: characterizations and computations, Euro. J. Oper. Res. 18(1982)57–61.

    Google Scholar 

  19. R.E. Marsten, An algorithm for large set partitioning problems, Manag. Sci. 20(1974)774–787.

    Google Scholar 

  20. R.E. Marsten and F. Shepardson, Exact solution of crew scheduling problems using the set partitioning model: recent successful applications, Networks 11(1981)165–177.

    Google Scholar 

  21. J.C. Falkner and D.M. Ryan, A bus crew scheduling system using a set partitioning model, Asia-Pacific J. Oper. Res. 4(1987)39–56.

    Google Scholar 

  22. J.E. Beasley, Linear programming on Cray supercomputers, J. Oper. Res. Soc. 41(1990)133–139.

    Google Scholar 

  23. M.L. Fisher and P. Kedia, Optimal solution of set covering/partitioning problems using dual heuristics, Manag. Sci. 36(1990)674–688.

    Google Scholar 

  24. R.S. Kwan, A. Wren and L.P. Zhao, Driver scheduling using intelligent estimation techniques with heuristic searches, in:Proc. 5th Int. Workshop on Computer-Aided Scheduling of Public Transport, ed. M. Desrochers and J.-M. Rousseau (Springer, 1992) pp. 379–394.

Download references

Author information

Authors and Affiliations

  1. School of Computing and Mathematics, University of Teesside, TS1 3BA, Middlesbrough, Cleveland, UK

    W. P. Willers

  2. Division of Operational Research and Information Systems, School of Computer Studies, University of Leeds, LS2 9JT, Leeds, UK

    L. G. Proll & A. Wren

Authors
  1. W. P. Willers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. G. Proll
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Wren
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Willers, W.P., Proll, L.G. & Wren, A. A dual strategy for solving the linear programming relaxation of a driver scheduling system. Ann Oper Res 58, 519–531 (1995). https://doi.org/10.1007/BF02057161

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02057161

Keywords

Search

Navigation