Highlights Developments of two new Multi-Objective Mixed Integer Linear Programming (MMILP) formulations for the Airline Fleet Maintenance Scheduling problem. Development of an iterative algorithm for solving large-scale real world instances efficiently. Testing of the solution methodology using a 30-day planning horizon with multiple airlines, with cases having 5-8 workshops, 6871-16000 flights, and 216-529 aircraft respectively.

    Abstract Fierce competition between airlines has led to the need of minimising the operating costs while also ensuring quality of service. Given the large proportion of operating costs dedicated to aircraft maintenance, cooperation between airlines and their respective maintenance provider is paramount. In this research, we propose a framework to develop commercially viable and maintenance feasible flight and maintenance schedules. Such framework involves two multi-objective mixed integer linear programming (MMILP) formulations and an iterative algorithm. The first formulation, the airline fleet maintenance scheduling (AMS) with violations, minimises the number of maintenance regulation violations and the number of not airworthy aircraft; subject to limited workshop resources and current maintenance regulations on individual aircraft flying hours. The second formulation, the AMS with tail assignment (TA) allows aircraft to be assigned to different flights. In this case, subject to similar constraints as the first formulation, six lexicographically ordered objective functions are minimised. Namely, the number of violations, maximum resource level, number of tail reassignments, number of maintenance interventions, overall resource usage, and the amount of maintenance required by each aircraft at the end of the planning horizon. The iterative algorithm ensures fast computational times while providing good quality solutions. Additionally, by tracking aircraft and using precise flying hours between maintenance opportunities, we ensure that the aircraft are airworthy at all times. Computational tests on real flight schedules over a 30-day planning horizon show that even with multiple airlines and workshops (16000 flights, 529 aircraft, 8 maintenance workshops), our solution approach can construct near-optimal maintenance schedules within minutes.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An optimisation framework for airline fleet maintenance scheduling with tail assignment considerations




    Publication date :

    2019-12-22


    Size :

    23 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Itinerary-based airline fleet assignment

    Kniker, Timothy S., 1969- | DSpace@MIT | 1998

    Free access

    Itinerary-Based Airline Fleet Assignment

    Barnhart, Cynthia | Online Contents | 2002


    Itinerary-Based Airline Fleet Assignment

    Barnhart, C. / Kniker, T. S. / Lohatepanont, M. | British Library Online Contents | 2002


    Weekly airline fleet assignment with homogeneity

    Bélanger, Nicolas / Desaulniers, Guy / Soumis, François et al. | Elsevier | 2005