A mixed integer linear program is presented for deterministically scheduling departure and ar rival aircraft at airport runways. This method addresses different schemes of managing the departure queuing area by treating it as first-in-first-out queues or as a simple par king area where any available aircraft can take-off ir respective of its relative sequence with others. In addition, this method explicitly considers separation criteria between successive aircraft and also incorporates an optional prioritization scheme using time windows. Multiple objectives pertaining to throughput and system delay are used independently. Results indicate improvement over a basic first-come-first-serve rule in both system delay and throughput. Minimizing system delay results in small deviations from optimal throughput, whereas minimizing throughput results in large deviations in system delay. Enhancements for computational efficiency are also presented in the form of reformulating certain constraints and defining additional inequalities for better bounds.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Incorporating Active Runway Crossings in Airport Departure Scheduling


    Contributors:

    Conference:

    AIAA Guidance, Navigation, and Control Conference ; 2010 ; Toronto, Ontario, Canada, Canada


    Publication date :

    2010-08-02


    Type of media :

    Conference paper


    Type of material :

    No indication


    Language :

    English




    Incorporating Active Runway Crossings in Airport Departure Scheduling

    Gupta, Gautam / Malik, Waqar / Jung, Yoon | AIAA | 2010


    Incorporating Active Runway Crossings in Airport Departure Scheduling

    Gupta, G. / Malik, W. / Jung, Y. et al. | British Library Conference Proceedings | 2010



    Multiobjective Departure Runway Scheduling Using Dynamic Programming

    Montoya, Justin / Rathinam, Sivakumar / Wood, Zachary | IEEE | 2014