Receding Horizon, Iterative Optimization of Taxiway Routing and Runway Scheduling

GL Clare, AG Richards, S Sharma

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

11 Citations (Scopus)

Abstract

This paper extends previous work on a coupled optimization method for airport taxiway routing and runway scheduling. An iterative method is used to reduce the computational demand of the required separation constraints whilst introducing no loss in performance. A Receding Horizon (RH) approach is added to further reduce the solution times. As well as faster solve times, RH enables the computation to be spread between horizons preventing detailed plans being calculated for the distant future. RH is an approximation to the globally optimal solution, but still shown to improve upon a First Come First Serve (FCFS) approach, by 56% when comparing the total taxi time and 9% when comparing runway throughput.
Translated title of the contributionReceding Horizon, Iterative Optimization of Taxiway Routing and Runway Scheduling
Original languageEnglish
Title of host publicationAIAA Guidance Navigation and Control Conference, Chicago
Publication statusPublished - Aug 2009

Bibliographical note

Conference Organiser: AIAA
Other identifier: AIAA-2009-5646

Fingerprint Dive into the research topics of 'Receding Horizon, Iterative Optimization of Taxiway Routing and Runway Scheduling'. Together they form a unique fingerprint.

Cite this