Uma Nova abordagem para o problema de programação integrada de veículos e motoristas

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 a new approach for vehicle and crew scheduling without changeovers. This model is based on the Maximum Covering Problem formulation. Preliminary computational results with real bus 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.