Modelling delay propagation within an airport network

We describe an analytical queuing and network decomposition model developed to study the complex phenomenon of the propagation of delays within a large network of major airports. The Approximate Network Delays (AND) model computes the delays due to local congestion at individual airports and captures the "ripple effect" that leads to the propagation of these delays. The model operates by iterating between its two main components: a queuing engine (QE) that computes delays at individual airports and a delay propagation algorithm (DPA) that updates flight schedules and demand rates at all the airports in the model in response to the local delays computed by the QE. The QE is a stochastic and dynamic queuing model that treats each airport in the network as a M(t)/E-k(t)/1 queuing system. The AND model is very fast computationally, thus making possible the exploration at a macroscopic level of the impacts of a large number of scenarios and policy alternatives on system-wide delays. It has been applied to a network consisting of the 34 busiest airports in the continental United States and provides insights into the interactions through which delays propagate through the network and the often-counterintuitive consequences. Delay propagation tends to "smoothen" daily airport demand profiles and push more demands into late evening hours. Such phenomena are especially evident at hub airports, where some flights may benefit considerably (by experiencing reduced delays) from the changes that occur in the scheduled demand profile as a result of delays and delay propagation. (C) 2011 Elsevier Ltd. All rights reserved.