TY  - JOUR
PY  - 1982//
TI  - Relaxation approaches to large scale bus driver scheduling problems
JO  - Transportation research part B: methodological
A1  - Carraresi, P.
A1  - Gallo, G.
A1  - Rousseau, Jean Marc
SP  - 383
EP  - 397
VL  - 16
IS  - 5
N2  - 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.<p /> <p>Language: en</p>
LA  - en
SN  - 0191-2615
UR  - http://dx.doi.org/10.1016/0191-2615(82)90020-0
ID  - ref1
ER  -