The problem of sequencing and scheduling airplanes landing and taking off on a runway is a major challenge for air traffic management. This difficult real-time task is still carried out by human controllers, with little help from automatic tools. Several methods have been proposed in the literature, including mixed-integer programming (MIP)–based approaches. However, there is an opinion that MIP is unattractive for real-time applications, since computation times are likely to grow too large. In this paper, we reverse this claim, by developing a MIP approach able to solve to optimality real-life instances from congested airports in the stringent times allowed by the application. To achieve this, it was mandatory to identify new classes of strong valid inequalities, along with developing effective fixing and lifting procedures.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Time-Indexed Formulations for the Runway Scheduling Problem


    Published in:

    Publication date :

    2017




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    Local classification TIB:    770/1935/7000
    BKL:    55.80 / 55.80 Verkehrswesen, Transportwesen: Allgemeines



    Time-Indexed Formulations for the Runway Scheduling Problem

    Avella, Pasquale / Boccia, Maurizio / Mannino, Carlo et al. | British Library Online Contents | 2017


    Stochastic Runway Scheduling

    Solak, Senay / Solveling, Gustaf / Clarke, John-Paul B. et al. | British Library Online Contents | 2018


    An optimal algorithm for a two runway scheduling problem

    Ravidas, Amrish | Online Contents | 2013


    An optimal algorithm for a two runway scheduling problem

    Ravidas, Amrish / Rathinam, Sivakumar / Wood, Zachary | SAGE Publications | 2013