Modelos e algoritmos para o problema de alocação de tripulação em redes de transporte

Abstract

The crew scheduling problem is a common activity that appears on public transport companies. The main goal of this problem is to assign the tasks to be carried out to different crews such that rules and regulations are respected and costs minimized. This problem is considered NP-Hard and generally it is split into two other problems: set covering and crew rostering. This thesis focusses on set covering problem. We give a formal definition, a literature revision and we present two heuristics to solve it a lagrangean and a genetic one. Computational results are also presented to evaluate the performance of the implementedalgorithms.