Receding Horizon, Iterative Optimization of Taxiway Routing and Runway Scheduling

GL Clare; AG Richards; S Sharma

Receding Horizon, Iterative Optimization of Taxiway Routing and Runway Scheduling

GL Clare, AG Richards, S Sharma

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

13 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 contribution	Receding Horizon, Iterative Optimization of Taxiway Routing and Runway Scheduling
Original language	English
Title of host publication	AIAA Guidance Navigation and Control Conference, Chicago
Publication status	Published - Aug 2009

Bibliographical note

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

Handle.net

Persistent link

Cite this

@inproceedings{acf6db5b25cd45b2bc56fe5293c7e74b,

title = "Receding Horizon, Iterative Optimization of Taxiway Routing and Runway Scheduling",

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.",

author = "GL Clare and AG Richards and S Sharma",

note = "Conference Organiser: AIAA Other identifier: AIAA-2009-5646",

year = "2009",

month = aug,

language = "English",

booktitle = "AIAA Guidance Navigation and Control Conference, Chicago",

}

TY - GEN

T1 - Receding Horizon, Iterative Optimization of Taxiway Routing and Runway Scheduling

AU - Clare, GL

AU - Richards, AG

AU - Sharma, S

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

PY - 2009/8

Y1 - 2009/8

N2 - 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.

AB - 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.

M3 - Conference Contribution (Conference Proceeding)

BT - AIAA Guidance Navigation and Control Conference, Chicago

ER -

Receding Horizon, Iterative Optimization of Taxiway Routing and Runway Scheduling

Abstract

Bibliographical note

Handle.net

Fingerprint

Cite this