Novos modelos e algoritmos para a programação integrada de veículos e tripulações

Abstract

The integrated vehicle and crew scheduling problem is a hard and widely studied Combinatorial Optimization problem. Several studies have shown that exact approaches for this problem are not useful in practical situations due to the high computational costs involved. This paper describes new mathematical integrated models for vehicle and crew scheduling. These models are based on the Maximum Covering Problem formulation. In addition, metaheuristics are proposed for the problem. Computational results with real vehicle and crew scheduling problem instances are presented and discussed. These results indicate that the proposed approach has a considerable potential for achieving significant gains in terms of operation costs.