In this paper we present a novel method to improve the robustness of solutions to the Flight-to-Gate Assignment Problem (FGAP), with the aim to reduce the need for gate re-planning due to unpredicted flight schedule disturbances in the daily operations at an airport. We propose an approach in which the deterministic gate constraints are replaced by stochastic gate constraints that incorporate the inherent stochastic flight delays in such a way so as to ensure that the expected gate conflict probability of two flights assigned to the same gate at the same time does not exceed a user-specified value. The novel approach is integrated into an existing multiple time slot FGAP model that relies on a binary integer programming formulation and is tested using real-life data pertaining to Amsterdam Airport Schiphol. The results confirm that the proposed approach holds out great promise to improve the robustness of the FGAP solutions.


    Access

    Download


    Export, share and cite



    Title :

    Robust flight-to-gate assignment using flight presence probabilities


    Contributors:

    Published in:

    Publication date :

    2017-11-17


    Size :

    18 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Robust flight-to-gate assignment using flight presence probabilities

    van Schaijk, Oscar R. P | Online Contents | 2017


    Robust flight gate assignment

    Jaehn, Florian | TIBKAT | 2008


    Robust flight-to-gate assignment with landside capacity constraints

    L’Ortye, J. / Mitici, M. / Visser, H.G. | Taylor & Francis Verlag | 2021

    Free access

    Flight Gate Assignment with a Quantum Annealer

    Stollenwerk, Tobias / Lobe, Elisabeth / Jung, Martin | German Aerospace Center (DLR) | 2019

    Free access

    Flight control examples of robust eigenstructure assignment

    Sobel, K.M. / Shapiro, E.Y. | Tema Archive | 1987