Skip to main content
SpringerLink
Log in
Book cover

Computer-Aided Transit Scheduling pp 267–277Cite as

A New Approach for the Crew Rostering Problem

  • Conference paper

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 430))

Abstract

In this paper an algorithm is presented for determining a lower bound for the Crew Rostering Problem (CRP). The formulation of the CRP presented is basically that of a Set Covering Problem (SCP) with additional constraints. The method proposed to derive a lower bound consists on solving a linear relaxation based on an adaptation of the classic Column Generation approach, since the reduced costs can only be underestimated. The associated sub-problem is shown to be a Shortest Path with Additional Constraints Problem. Furthermore, a very efficient cut for the formulation is presented.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Azevedo, J. A. / Martins E.Q. V. (1991): An algorithm for the multi-objective shortest path problem in acyclic networks. in: Investigaçào Operacional 11

    Google Scholar 

  • Baker, K. R. (1974): Scheduling a full-time workforce to meet cyclic staffing requirements. in: Management Science 22

    Google Scholar 

  • Baker, K. R. (1976): Workforce allocation in cyclic scheduling problems. in: Operational Research Quarterly 27

    Google Scholar 

  • Baker, K. R. / Magazine, M. J. (1977): Workforce scheduling with cyclic demands and day-off constraints. in: Management Science 24

    Google Scholar 

  • Bartholdi, J. J. (1981): A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering. in: Operations Research 29

    Google Scholar 

  • Bartholdi, J. J. / Orlin, J. / Ratliff, H. D. (1980): Cyclic scheduling via integer programs with circular ones. in: Operations Research 28

    Google Scholar 

  • Bazaraa, M. / Jarvis, J. J. (1977): Linear programming and network flows. (John Wiley) New York

    Google Scholar 

  • Beasley, J. E. / Christofides, N. (1989): An algorithm for the resource constrained shortest path problem. in: Networks 19

    Google Scholar 

  • Belleti, R. / Davini, A. / Carraresi, P. / Gallo, G. (1985): BDROP: A package for the bus drivers’ rostering problem. in: Rousseau, J.-M. (ed.): Computer scheduling of public transport 2. (North-Holland) Amsterdam, New York, Oxford

    Google Scholar 

  • Bianco, L. / Bielli, M. / Ricciardelli, S. / Mingozzi, A. / Spadoni, M. (1992): A heuristic procedure for the crew rostering problem. in: European Journal of Operational Research 58

    Google Scholar 

  • Carraresi, P. / Gallo, G. (1984a): A multi-level bottleneck assignement approach to the bus drivers’ rostering problem. in: European Journal of Operational Research 16

    Google Scholar 

  • Carraresi, P. / Gallo, G. (1984b): Network models for vehicle and crew scheduling. in:European Journal of Operational Research 16

    Google Scholar 

  • Christofides, N. / Korman, S. (1975): Computational survey of methods for the set covering problem. in: Management Science 5

    Google Scholar 

  • Desrochers, M. (1986a): La fabrication d’horaires de travail por les conducteurs d’autobus par un methode de genération de colonnes. Publicação #420, Centre de Recherche sur les Transports, Université de Montréal

    Google Scholar 

  • Desrochers, M. (1986b): An algorithm for the shortest path problem with resource constraints. Publicação #421 A, Centre de Recherche sur les Iransports, Université de Montréal

    Google Scholar 

  • Desrochers, M. / Soumis, F. (1988): CREW-OPT: Crew scheduling by column generation. in: Daduna, J.R. / Wren, A. (eds.): Computer-aided transit scheduling. (Springer) Berlin, Heidelberg, New York, London, Paris, Tokyo.

    Google Scholar 

  • Desrochers, M / Soumis, F. (1988): A reoptimization algorithm for the shortest path problem with time windows. in: European Journal of Operational Research 35

    Google Scholar 

  • Desrochers, M. / Soumis, F. (1989): A column generation approach to the urban transit crew schwduling problem. in: Transportation Science 23

    Google Scholar 

  • Desroisiers, J. / Dumas, Y. / Solomon, M. M. / Soumis, F. (1992): Time constrained routing and scheduling. Les Cahiers du GERAD

    Google Scholar 

  • Gilmore, P. C. / Gomory, R. E. (1961): A linear programming approach to the cutting-stock problem”. in: Operations Research

    Google Scholar 

  • Gilmore, P. C. &Gomory, R. E. (1963): A linear programming approach to the cutting-stock problem — Part II. in: Operations Research

    Google Scholar 

  • Hagberg, B. (1985): An assignement approach to the rostering problem: An application to taxi vehicles. in: Rousseau, J.-M. (ed.): Computer scheduling of public transport 2. (North-Holland) Amsterdam, New York, Oxford

    Google Scholar 

  • Ibaraki, T. (1987): Enumerative approaches to combinatorial optimization. in: Annals of Operations Research 11

    Google Scholar 

  • Jachnik, J. (1981): Attendance and rostering systems. in: A. Wren (ed.). Computer Scheduling of Public Transport. (North-Holland) Amsterdam, New York, Oxford.

    Google Scholar 

  • Koop, G. J. (1986): Cyclic scheduling of offweekends. in: Operations Research Letters 4

    Google Scholar 

  • Martins, E. Q. V. (1984a): An algorithm for ranking paths that may contain cycles. in: European Journal of Operational Research 18

    Google Scholar 

  • Martins, E. Q. V. (1984b): On a Multicriteria Shortest Path Problem. in: European Journal of Operational Research 16

    Google Scholar 

  • Nehmauser, G. L. / Wolsey, L. A. (1988): Integer and combinatorial optimization. (Wiley-Inter-science)

    Google Scholar 

  • Nygard, K. / Juell, P. / Kadaba, N. (1990): Neural networks for selecting vehicle routing heuristics. in: ORSA Journal of Computing 2

    Google Scholar 

  • Ribeiro, C. C. / Soumis, F. (1991): A column generation approach for the multiple-depot vehicle scheduling problem. Les Cahiers du GERAD

    Google Scholar 

  • Townsend, W. (1987): An application of the assignment model to bus crew rostering. in: IMA Journal of Mathematics in Management 1

    Google Scholar 

  • Warburton, A. (1987): Approximation of pareto optima in multiple-objective, Shortest-path problems. in: Operations Research 35

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEIO, Faculdade de Ciências da Universidade de Lisboa, Lisboa, Portugal

    Fernando Catanas & José M. Pinto Paixão

Authors
  1. Fernando Catanas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José M. Pinto Paixão
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachhochschule Konstanz, Fachbereich Witschafts- und Sozialwissenschaften, Brauneggerstraße 55, D-78462, Konstanz, Germany

    Joachim R. Daduna

  2. University of Lisbon DEIO, Edifício C2, Cidade Universitária, 1700, Lisbon, Portugal

    Isabel Branco  & José M. Pinto Paixão  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Catanas, F., Paixão, J.M.P. (1995). A New Approach for the Crew Rostering Problem. In: Daduna, J.R., Branco, I., Paixão, J.M.P. (eds) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 430. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57762-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-57762-8_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60193-7

  • Online ISBN: 978-3-642-57762-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation