Modeling and Solving A Crew Assignment Problem in Air Transportation

Farah Zeghal Mansour , Michel Minoux (1)

1 DECISION

A typical problem arising in airline crew management consists in optimally assigning the required crew members to each flight segment of a given time period, while complying with a variety of work regulations and collective agreements. This problem called the Crew Assignment Problem (CAP) is currently decomposed into two independent sub-problems which are modeled and solved sequentially: (a) the well-known Crew Pairing Problem followed by (b) the Working Schedules Construction Problem. In the first sub-problem, a set of legal minimum-cost pairings is constructed, covering all the planned flight segments. In the second sub-problem, pairings, rest periods, training periods, annual leaves, etc. are combined to form working schedules which are then assigned to crew members. In this paper, we present a new approach to the Crew Assignment Problem arising in the context of airline companies operating short and medium haul flights. Contrary to most previously published work on the subject, our approach is not based on the concept of crew-pairings, though it is capable of handling many of the constraints present in crew-pairing-based models. Moreover, contrary to crew-pairing-based approaches, one of its distinctive features is that it formulates and solves the two sub-problems (a) and (b) simultaneously for the technical crew members (pilots and officers) with specific constraints. We show how this problem can be formulated as a large scale integer linear program with a general structure combining different types of constraints and not exclusively partitioning or covering constraints as usually suggested in previous papers. We introduce then, a formulation enhancement phase where we replace a large number of binary exclusion constraints by stronger and less numerous ones: the clique constraints. Using data provided by the Tunisian airline company TunisAir, we demonstrate that thanks to this new formulation, the Crew Assignment Problem can be solved by currently available integer linear programming technology. Finally, we propose an efficient heuristic method based on a rounding strategy embedded in a partial tree search procedure. The implementation of these methods (both exact and heuristic ones) provides good solutions in reasonable computation times using CPLEX 6.0.2: guaranteed exact solutions are obtained for 60% of the test instances and solutions within 5% of the lower bound for the others.

Domaines: Informatique [cs]

Farah Zeghal Mansour, Michel Minoux. Modeling and Solving A Crew Assignment Problem in Air Transportation. European Journal of Operational Research, 2006, 175 (1), pp.187-209. ⟨10.1016/j.ejor.2004.11.028⟩. ⟨hal-01146497⟩