Decomposition algorithms for analyzing transient phenomena in multiclass queuing networks in air transportation
Michael D. Peterson, Dimitris Bertsimas, Amedeo R. Odoni · 1995
In a previous paper (Peterson, Bertsimas, and Odoni 1992), we studied the phe-nomenon of transient congestion in landings at a hub airport and developed a recursive approach for computing moments of queue lengths and waiting times. In this paper we extend our approach to a network, developing two approximations based on the method used for the single hub. We present computational results for a simple 2-hub network and indicate the usefulness of the approach in analyzing the interaction be-tween hubs. Although our motivation is drawn from air transportation, our method is applicable to all multi-class queuing networks where service capacity at a station may be modeled as a Markov or semi-Markov process. Our method represents a new approach for analyzing transient congestion phenomena in such networks. Airport congestion and delay have grown significantly over the last decade. By 1986 ground delays at domestic airports averaged 2000 hours per day, the equivalent of grounding