Surface congestion causes significant taxi delays at busy airports. This paper proposes two different approaches to optimizing both taxiway and runway schedules simultaneously. The first is an integrated approach based on a single mixed-integer linear programming (MILP) model, while the second is a sequential method that sequentially combines runway scheduling and taxiway scheduling algorithms. The two optimization approaches are compared and evaluated using flight schedules at Detroit airport (DTW), by analyzing several airport performance metrics. The effectiveness of the proposed optimization methods in the current operational environment is also investigated through fast-time surface traffic simulations.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A comparison of two optimization approaches for airport taxiway and runway scheduling


    Contributors:


    Publication date :

    2012-10-01


    Size :

    1035108 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A comparison of two optimization approaches for airport taxiway and runway scheduling

    Hanbong Lee, / Balakrishnan, H. | IEEE | 2012

    Free access

    Optimization of Taxiway Routing and Runway Scheduling

    Clare, Gillian L. / Richards, Arthur G. | IEEE | 2011


    Optimization of Taxiway Routing and Runway Scheduling

    Keith, G. / Richards, A. / Sharma, S. et al. | British Library Conference Proceedings | 2008



    Optimization of Taxiway Routing and Runway Scheduling

    Keith, Gillian / Richards, Arthur / Sharma, Sanjiv | AIAA | 2008