Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301) 2002
DOI: 10.1109/acc.2002.1023202
|View full text |Cite
|
Sign up to set email alerts
|

Modeling and control of airport queueing dynamics under severe flow restrictions

Abstract: Based on field observations and interviews with controllers at BOS and EWR, we identify the closure of local departure fixes as the most severe class of airport departure restrictions. A set of simple queueing dynamics and "traffic rules" are developed to model departure traffic under such restrictions. The validity of the proposed model is tested via Monte Carlo simulation against 10 hours of actual operations data collected during a case-study at EWR on June 29,2000. In general, the model successfully reprod… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
24
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 29 publications
(24 citation statements)
references
References 3 publications
0
24
0
Order By: Relevance
“…[4][5][6][7] Since surface operations are highly heterogenous in terms of taxi speeds, routes and pilot behavior, Eulerian models 8,9 of traffic flow are not applicable here. Most traditional solution approaches involve the use of optimal scheduling algorithms 6,7 or queuing theory, [3][4][5] both of which have certain drawbacks. Optimization using linear or mixed-integer programming assumes that aircraft move at constant velocities at all times and follow time-based taxi instructions exactly, which are not realistic assumptions given the current state of technology at airports.…”
Section: A Related Workmentioning
confidence: 99%
“…[4][5][6][7] Since surface operations are highly heterogenous in terms of taxi speeds, routes and pilot behavior, Eulerian models 8,9 of traffic flow are not applicable here. Most traditional solution approaches involve the use of optimal scheduling algorithms 6,7 or queuing theory, [3][4][5] both of which have certain drawbacks. Optimization using linear or mixed-integer programming assumes that aircraft move at constant velocities at all times and follow time-based taxi instructions exactly, which are not realistic assumptions given the current state of technology at airports.…”
Section: A Related Workmentioning
confidence: 99%
“…The projected traffic level, k p , can be calculated based on the expected times between successive departures, as given in Eqn. (6). Since entry into the network is assumed FCFS, the projected traffic level decreases as t p increases (there can be no additional aircraft entering the network while the current aircraft is waiting).…”
Section: B Formulation Of Control Strategymentioning
confidence: 99%
“…Most traditional approaches to this problem involve the use of optimal scheduling algorithms [2], [3] or queuing theory [4], [5], [6]. Optimization methods typically assume that aircraft move at constant velocities at all times, and follow time-based taxi instructions exactly.…”
Section: B Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…For applications requiring finer detail than ASQP provides, good results have been obtained using data from FAA tower flight-strips [2]. When combined with tower and TRACON logs, flightstrip data provides a very thorough and complete description of traffic at a given airport.…”
Section: Description Of Input and Outputmentioning
confidence: 94%