A slot allocation policy assigns a time slot for departure to each of a number of flights in order to avoid overload in control sectors and on runways. We present a new solution method for a basic version of the European slot allocation problem. The approach is based on an integer linear programming model, where for each flight there is a set of 0-1 variables each associated with one of its possible departure slots. First, column generation is used to solve the LPrelaxation. This results in the construction of a reasonable set of departure slots for each of the flights. Then, the resulting integer linear program is solved. We also present a rounding heuristic to derive feasible integral solutions from fractional solutions after each iteration of the column generation algorithm. Computational results for real-world problems are encouraging, because they indicate that compared to existing exact optimisation algorithms ourmethod generates solutions of approximately the same quality but requires only a fraction of the computation time. Moreover, they indicate that the rounding heuristic performs well.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Slot Allocation by Column Generation


    Contributors:

    Publication date :

    1997


    Size :

    36 pages


    Type of media :

    Report


    Type of material :

    No indication


    Language :

    English




    Slot allocation by column generation

    Akker, J. M. / Nachtigall, K. / Nationaal Lucht- en Ruimtevaartlaboratorium | TIBKAT | 1997


    Slot Allocation

    Sorensen, F. / Royal Aeronautical Society | British Library Conference Proceedings | 1997


    Departure Slot Allocation

    Durand, Nicolas / Gianazza, David / Gotteland, Jean‐Baptiste et al. | Wiley | 2015



    Slot Allocation of Vertiport Resources

    CHUA ZARRIN / GIULIANO ALFREDO / NAVARRO FÉLIX FRANCISCO A et al. | European Patent Office | 2023

    Free access