Resource allocation in flow-constrained areas with stochastic termination times.

Moein Ganji, David J. Lovell, Michael O. Ball, and Alex Nguyen

Transportation Research Record 2106, pp. 90–99.

ABSTRACT

In this paper we address a stochastic air traffic flow management problem. Our problem arises when airspace congestion is predicted, usually because of a weather disturbance, so that the number of flights passing through a volume of airspace must be reduced. In the U.S., in such situations, the Federal Aviation Administration identifies the congested volume of airspace and implements an airspace flow program to regulate traffic. We formulate an optimization model for the assignment of dispositions to flights whose preferred flight plans pass through the congestion. For each flight, the disposition can be either to depart as scheduled but via a secondary route that avoids the congestion, or to use the originally intended route but to depart with a controlled departure time and accompanying ground delay. We anticipate that the capacity of the congested area may increase at some future time once the weather activity clears. The model is a two-stage stochastic program that represents the time of this capacity windfall as a random variable, and determines expected costs given a second-stage decision, conditioning on that time. The goal is to minimize the expected cost over the entire distribution of possible capacity increase times.