Heuristics to solve the integrated airline crew assignment problem

• Autor(a) principal: Gomes,Wagner P.
• Data de Publicação: 2015
• Outros Autores: Gualda,Nicolau D. F.
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Journal of Transport Literature
• Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S2238-10312015000100025
• topic: air transportation; airline crew assignment; combinatorial optimization heuristics

A typical problem related to airline crew management consists of optimally assigning the required crew members to planned flights for a given period of time, while complying with a variety of labor regulations, safety rules and policies of the airline. This problem, called crew assignment problem (CAP), is of the NPHard class. So, it is usually divided into two independent subproblems, crew pairing problem (CPP) and crew rostering problem (CRP), modeled and solved sequentially. This division does not provide a global treatment to the CAP in terms of total cost and quality of the final solution. The state of the art involves the integrated solution of CAP, with both subproblems (CPP and CRP) solved simultaneously. It still requires high computational effort. Its combinatorial nature makes it difficult (or even impossible) to be solved by exact methods. The methodology proposed in this research provides an integrated solution of the CAP with heuristic procedures. The methodology was tested to solve instances related to small and medium-sized Brazilian airlines. The results were also compared with those obtained through an exact model adapted from the literature.