The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints

  • The tail assignment problem is a critical part of the airline planning process that assigns specific aircraft to sequences of flights, called lines-of-flight, to satisfy operational constraints. The aim of this paper is to develop an operationally flexible method, based upon the one-day routes business model, to compute tail assignments that satisfy short-range—within the next three days—aircraft maintenance requirements. While maintenance plans commonly span multiple days, the methods used to compute tail assignments for the given plans can be overly complex and provide little recourse in the event of schedule perturbations. The presented approach addresses operational uncertainty by using solutions from the one-day routes aircraft maintenance routing approach as input. The daily tail assignment problem is solved with an objective to satisfy maintenance requirements explicitly for the current day and implicitly for the subsequent two days. A computational study will be performed to assess the performance of exact and heuristic solution algorithms that modify the input lines-of-flight to reduce maintenance misalignments. The daily tail assignment problem and the developed algorithms are demonstrated to compute solutions that effectively satisfy maintenance requirements when evaluated using input data collected from three different airlines.

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Stephen J. Maher, Guy Desaulniers, Francois Soumis
Document Type:Article
Parent Title (English):European Journal of Operational Research
Volume:264
Issue:2
First Page:534
Last Page:547
Year of first publication:2018
Preprint:urn:nbn:de:0297-zib-56717
DOI:https://doi.org/10.1016/j.ejor.2017.06.041