Driver scheduling problem modelling

The Drivers Scheduling Problem (DSP) consists of selecting a set of duties for vehicle drivers, such as bus, train and boat drivers or plane pilots, for the transportation of passengers or goods. This is a complex problem as it involves several constraints related to labour and company rules and may also entail different evaluation criteria and objectives. The ability to develop an adequate model for this problem, which can represent the real problem as closely as possible is an important research area. In this paper we present new mathematical models for the DSP which embody the very complexity of the drivers scheduling problem, besides demonstrating that the solutions generated by these models can easily be implemented in real situations. On the strength of extensive passenger transportation experience in bus companies in Portugal, we propose and test new alternative models to formulate the DSP. These models are based on Set Partitioning/Covering models. Moreover, they also take into account the bus operator issues and the user’s standpoint and environment.Thanks are due to Fundação para a Ciência e Tecnologia (SFRH/ BD / 1054 / 2000) for providing funding to support the work described in this paper (first author). Thanks are due to Ministerio de Educación y Ciencia, Spain (SEC2003-01991/ECO) for providing funding to supportthe work (second author)