Skip to main content
SpringerLink
Log in

Crew rostering problem in a public transport company

  • Case-Oriented Paper
  • Published:
Journal of the Operational Research Society

Abstract

In this paper, we present an applied study commissioned by Metro Bilbao on how to establish a more egalitarian annual allocation of work to drivers. Task allocation is mixed, with some tasks allocated on a rotating basis and others not. The model proposed is solved as a sequence of four types of integer programming problem. The solution obtained is quasi-optimal: all drivers carry out practically the same tasks over the full year. The main contribution of this paper is its method for combining semi-rotating allocation with a planning time frame divided into five periods of three different types with a workload distributed in a non uniform fashion over the days of the week, and with constraints agreed with employees to obtain an egalitarian solution. This method is being implemented at Metro Bilbao, and Eusko Tren has commissioned a study into a similar method by the authors.

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

  • Azmat CS, Hürlimann T and Widmer M (2004). Mixed integer programming to schedule a single-shift workforce under annualized hours. Ann Opns Res 128: 199–215.

    Article  Google Scholar 

  • Beaumont N (1997). Using mixed integer programming to design employee rosters. J Opl Res Soc 48: 585–590.

    Article  Google Scholar 

  • Caprara A et al (1997). Algorithms for railway crew management. Math Program 79: 125–141.

    Google Scholar 

  • Caprara A, Toth P, Vigo D and Fischetti M (1998). Modeling and solving the crew rostering problem. Opns Res 46: 820–830.

    Article  Google Scholar 

  • Caprara A et al (1999). Solution of Large-scale Railway Crew Planning Problems: The Italian Experience. Lecture Notes in Economics and Mathematical Systems, Vol. 471. Springer-Verlag: Berlin.

    Google Scholar 

  • Ernst A et al (2000). Rail crew scheduling and rostering: Optimisation algorithms. In: Voss S and Daduna JR (eds). Computer Aided Scheduling of Public Transport. Lecture Notes in Economics and Mathematical Systems. Vol. 505. Springer-Verlag, Berlin, pp 53–72.

    Google Scholar 

  • Ernst A, Jiang H, Krishnamoorthy M and Sier D (2004). Staff scheduling and rostering: A review of applications, methods and models. Eur J Opl Res 153: 3–27.

    Article  Google Scholar 

  • Esclapés C (2000). Asignación de conductores a jornadas de trabajo en empresas de transporte colectivo. PhD thesis, Universitat Politécnica de Catalunya, Spain.

    Google Scholar 

  • Eveborn P and Rönnqvist M (2004). Scheduler—A system for staff planning. Ann Opns Res 128: 21–45.

    Article  Google Scholar 

  • Isken MW (2004). An implicit tour scheduling model with applications in healthcare. Ann Opns Res 128: 91–109.

    Article  Google Scholar 

  • Laporte G (1999). The art and science of designing rotating schedules. J Opl Res Soc 50: 1011–1017.

    Article  Google Scholar 

  • Laporte G and Pesant G (2004). A general multi-shift scheduling system. J Opl Res Soc 55: 1208–1217.

    Article  Google Scholar 

  • Lindo Systems Inc (2003). Lingo User's Guide. Chicago.

  • Muslija N, Gärtner J and Slany W (2002). Efficient generation of rotating workforce schedules. Disc Appl Math 118: 85–98.

    Article  Google Scholar 

  • Randhawa SU and Sitompul D (1993). A heuristic-based computerized nurse scheduling system. Comput Opns Res 20: 837–844.

    Article  Google Scholar 

  • Scott AJ (ed) (1991). Shiftwork: Occupational Medicine State of the Art Reviews, 5. Hanley and Belfus Inc.: Philadelphia.

    Google Scholar 

  • Tharmmaphornphilas W and Norman BA (2004). A quantitative method for determining proper job rotation intervals. Ann Opns Res 128: 251–266.

    Article  Google Scholar 

  • Townsend W (1988). An approach to bus-crew roster design in London regional transport. J Opl Res Soc 6: 543–550.

    Article  Google Scholar 

Download references

Acknowledgements

We thank José Miguel Ortega for suggesting this problem to us and Juan Carlos Mendoza and Fernando Quintanilla, all of Metro Bilbao, for their help in resolving it. We also thank the anonymous referees for their useful comments, which have greatly improved the paper. This study was carried out with the cooperation of Fundación Euskoiker.

Author information

Authors and Affiliations

  1. Universidad del País Vasco, Bilbao, Spain

    M Lezaun, G Pérez & E Sáinz de la Maza

Authors
  1. M Lezaun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E Sáinz de la Maza
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M Lezaun.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lezaun, M., Pérez, G. & Sáinz de la Maza, E. Crew rostering problem in a public transport company. J Oper Res Soc 57, 1173–1179 (2006). https://doi.org/10.1057/palgrave.jors.2602088

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/palgrave.jors.2602088

Keywords

Search

Navigation