OPTIMIZING INTEGRATED TERMINAL AIRSPACE OPERATIONS UNDER UNCERTAINTY

In the terminal airspace, integrated departures and arrivals have the potential to increase operations efficiency. Recent research has developed genetical-algorithm-based schedulers for integrated arrival and departure operations under uncertainty. This paper presents an alternate method using a machine job-shop scheduling formulation to model the integrated airspace operations. A multistage stochastic programming approach is chosen to formulate the problem and candidate solutions are obtained by solving sample average approximation problems with finite sample size. Because approximate solutions are computed, the proposed algorithm incorporates the computation of statistical bounds to estimate the optimality of the candidate solutions. A proof-of-concept study is conducted on a baseline implementation of a simple problem considering a fleet mix of 14 aircraft evolving in a model of the Los Angeles terminal airspace. A more thorough statistical analysis is also performed to evaluate the impact of the number of scenarios considered in the sampled problem. To handle extensive sampling computations, a multithreading technique is introduced.