Multiple objective solution approaches for aircraft rerouting under the disruption of multi-aircraft

This paper considers a multi-objective aircraft recovery problem for airline disruption. An integer programming formulation is first established based on connection network with three conflicting objectives, where the first objective minimizes the total deviation from original flight schedules, the second objective minimizes the maximal flight delay time, and the third objective minimizes the number of aircraft actually attended in swapping. Optimal analysis is provided for a small scale aircraft recovery problem with the last two objectives and then one polynomial time algorithm for aircraft recovery problem after the disruption to multi-aircraft in a fleet at an airport. One heuristic combined ε-constraints method and neighborhood search algorithm is designed for large scale disruption recovery problem. The results obtained from computational experiment illustrate effectiveness and efficiency of the heuristic. The outcome of this research could provide theoretical and practical supports for airlines to reduce flight delays.