This paper describes a mixed-integer linear programming optimization method for the coupled problems of airport taxiway routing and runway scheduling. The receding-horizon formulation and the use of iteration in the avoidance constraints allows the scalability of the baseline algorithm presented, with examples based on Heathrow Airport, London, U.K., which contains up to 240 aircraft. The results show that average taxi times can be reduced by half, compared with the first-come-first-served approach. The main advantage is shown with the departure aircraft flow. Comparative testing demonstrates that iteration reduces the computational demand of the required separation constraints while introducing no loss in performance.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimization of Taxiway Routing and Runway Scheduling


    Contributors:


    Publication date :

    2011-12-01


    Size :

    1052512 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    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



    Receding Horizon, Iterative Optimization of Taxiway Routing and Runway Scheduling

    Clare, Gillian / Richards, Arthur / Sharma, Sanjiv | AIAA | 2009


    Receding Horizon, Iterative Optimization of Taxiway Routing and Runway Scheduling

    Clare, G. / Richards, A. / Sharma, S. et al. | British Library Conference Proceedings | 2009