Relaxation approaches to large scale bus driver scheduling problems

The bus driver scheduling (BDS) problem in a transit company consists of establishing, at minimum cost, a list of work-days in which a driver is assigned to each bus in the given time-table and all clauses of the union contract are respected. In this paper we present a general mathematical programming formulation for the BDS problem. Because, in general, the problem is too large to be solved directly, we introduce a relation of the problem and three different solution approaches. Computational results obtained on real life problems indicate that mathematical programming techniques can solve the BDS problem efficiently.