Decomposition Algorithms for Analyzing Transient Phenomena in Multi-class Queueing Networks in Air Transportation
In a previous paper (Peterson, Bertsimas, and Odoni 1992), we studied the phenomenon 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 app...
| Main Authors: | , , |
|---|---|
| Format: | Working Paper |
| Language: | en_US |
| Published: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
| Online Access: | http://hdl.handle.net/1721.1/5202 |
| _version_ | 1826205205168914432 |
|---|---|
| author | Peterson, Michael D. Bertsimas, Dimitris J. Odoni, Amedeo R. |
| author_facet | Peterson, Michael D. Bertsimas, Dimitris J. Odoni, Amedeo R. |
| author_sort | Peterson, Michael D. |
| collection | MIT |
| description | In a previous paper (Peterson, Bertsimas, and Odoni 1992), we studied the phenomenon 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 between 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 the entire fleet of Delta Airlines at that tillie (250 aircraft) for one day (Donoghue 1986). In 1990, 21 airports in the U.S. exceeded 20, 000 hours of delay, with 12 more projected to exceed this total by 1997 (National Transportation Research Board 1991). This amounts to *School of Public and Environmental Affairs, Indiana University, Bloomington, Indiana tSloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts ;Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, Massachusetts |
| first_indexed | 2024-09-23T13:09:02Z |
| format | Working Paper |
| id | mit-1721.1/5202 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:09:02Z |
| publishDate | 2004 |
| publisher | Massachusetts Institute of Technology, Operations Research Center |
| record_format | dspace |
| spelling | mit-1721.1/52022019-04-12T13:40:49Z Decomposition Algorithms for Analyzing Transient Phenomena in Multi-class Queueing Networks in Air Transportation Peterson, Michael D. Bertsimas, Dimitris J. Odoni, Amedeo R. In a previous paper (Peterson, Bertsimas, and Odoni 1992), we studied the phenomenon 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 between 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 the entire fleet of Delta Airlines at that tillie (250 aircraft) for one day (Donoghue 1986). In 1990, 21 airports in the U.S. exceeded 20, 000 hours of delay, with 12 more projected to exceed this total by 1997 (National Transportation Research Board 1991). This amounts to *School of Public and Environmental Affairs, Indiana University, Bloomington, Indiana tSloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts ;Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, Massachusetts 2004-05-28T19:27:49Z 2004-05-28T19:27:49Z 1993-03 Working Paper http://hdl.handle.net/1721.1/5202 en_US Operations Research Center Working Paper;OR 278-93 1975306 bytes application/pdf application/pdf Massachusetts Institute of Technology, Operations Research Center |
| spellingShingle | Peterson, Michael D. Bertsimas, Dimitris J. Odoni, Amedeo R. Decomposition Algorithms for Analyzing Transient Phenomena in Multi-class Queueing Networks in Air Transportation |
| title | Decomposition Algorithms for Analyzing Transient Phenomena in Multi-class Queueing Networks in Air Transportation |
| title_full | Decomposition Algorithms for Analyzing Transient Phenomena in Multi-class Queueing Networks in Air Transportation |
| title_fullStr | Decomposition Algorithms for Analyzing Transient Phenomena in Multi-class Queueing Networks in Air Transportation |
| title_full_unstemmed | Decomposition Algorithms for Analyzing Transient Phenomena in Multi-class Queueing Networks in Air Transportation |
| title_short | Decomposition Algorithms for Analyzing Transient Phenomena in Multi-class Queueing Networks in Air Transportation |
| title_sort | decomposition algorithms for analyzing transient phenomena in multi class queueing networks in air transportation |
| url | http://hdl.handle.net/1721.1/5202 |
| work_keys_str_mv | AT petersonmichaeld decompositionalgorithmsforanalyzingtransientphenomenainmulticlassqueueingnetworksinairtransportation AT bertsimasdimitrisj decompositionalgorithmsforanalyzingtransientphenomenainmulticlassqueueingnetworksinairtransportation AT odoniamedeor decompositionalgorithmsforanalyzingtransientphenomenainmulticlassqueueingnetworksinairtransportation |