The terminal-area surrounding an airport is an important component of the air transportation system, and efficient and robust terminal-area schedules are essential for successfully meeting the projected increase in air traffic demand. Aircraft arrival schedules are subject to a variety of operational constraints, such as minimum separation requirements for safety, required arrival time-windows, limited deviation from a nominal or FCFS sequence, and precedence constraints on the arrival order. With these constraints, there is a range of desirable objectives associated with multiple stakeholders that could be optimized in these schedules. The schedules should also be robust against the uncertainty around the terminal-area. A dynamic programming algorithm for determining the minimum cost arrival schedule, given the aircraft-dependent delay costs, is presented in this thesis. The proposed approach makes it possible to determine various tradeoffs between multiple objectives in terminal-area operations. The comparison of schedules that maximize throughput to those that minimize average delay shows that the benefit from maximizing throughput could be at the expense of an increase in average delay, and that minimizing average delay is the more advantageous of the two objectives in most cases. A comprehensive analysis of the tradeoffs between throughput and fuel costs, and throughput and operating costs is conducted, accounting for both the cost of delay (as reported by the airlines) and the cost of speeding-up when possible (from models of aircraft performance). It is also demonstrated that the proposed aircraft scheduling algorithm can be applied to the optimization problem for the coupled operations of arrivals and departures on a single runway.
展开▼
