Uma abordagem para a solução de problemas de rotações de tripulações para empresas aéreas utilizando busca tabu e janelas de tempo

Abstract

The flight scheduling crews in airliners are an important factor in logistic of operations of a these companies and interesting problem for the application of Operational Research. The costs

with crew members in the air transportation are extremely high, superior 20% of the costs of operations of the companies. So, this study presents an approach of the crew pairing problem in airlines. The objective of this planning is to find a subgroup of these pairings with minimum cost and that it covers all the flight legs in the programming of the airliners taking care of the inherent restrictions to the problem. The solution for the problem implemented a set covering/set

partitioning model, first, promoting, a viable initial solution that was applied, in one second stage, to optimize process using the meta-heuristic Tabu Search and time windows. The results had disclosed values satisfactory, demonstrating solutions that, compared with the real solution, had promoted minimization indices superior 70%. The validation