Crew rostering problem in a public transport company

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.

Keywords:

• manpower planning
• crew rostering
• scheduling
• integer programming

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.