Dynamic control of runway configurations and of arrival and departure service rates at jfk airport under stochastic queue conditions

High levels of flight delays require implementation of airport congestion mitigation tools. In this paper, we optimize the use of airport capacity at the tactical level in the face of operational uncertainty. We formulate an original Dynamic Programming model that jointly and dynamically selects runway configurations and the balance of arrival and departure service rates at a busy airport to minimize congestion costs, under stochastic queue dynamics and stochastic operating conditions. Control is exercised as a function of flight schedules, of arrival and departure queue lengths, and of weather and wind conditions. We implement the model in a realistic setting at JFK Airport. The exact Dynamic Programming algorithm terminates within reasonable time frames. In addition, we implement an approximate one-step look-ahead algorithm that considerably accelerates execution of the model and results in close-to-optimal policies. Together, these solution algorithms enable online implementation of the model using real-time information on flight schedules and meteorological conditions. Application of the model shows that the optimal policy is path-dependent, i.e., it depends on prior decisions and on the stochastic evolution of arrival and departure queues during the day. This underscores the theoretical and practical need for integrating operating stochasticity into the decision-making framework. From comparisons with an alternative model based on deterministic queue dynamics, we estimate the benefit of considering queue stochasticity at 5% to 20%. Finally, comparisons with heuristics designed to imitate actual operating procedures suggest that the model can yield significant cost savings, estimated at 20% to 30%.