4.7 Article

Scenario-based air traffic flow management: From theory to practice

Journal

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
Volume 42, Issue 7-8, Pages 685-702

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trb.2008.01.002

Keywords

air traffic flow management; ground delay program; ground holding problem; capacity scenarios; airport capacity; stochastic optimization; dynamic optimization

Ask authors/readers for more resources

Recent developments in solving the single airport ground holding problem use static or dynamic optimization to manage uncertainty about how airport capacities will evolve. Both static and dynamic models involve the use of scenarios that depict different possible capacity evolutions. Dynamic models also require scenario trees featuring branch points where previously similar capacity profiles become distinct. In this paper, we present methodologies for generating and using scenario trees from empirical data and examine the performance of scenario-based models in a real-world setting. We find that most US airports have capacity profiles that can be classified into a small number of nominal scenarios, and for a number of airports these scenarios can be naturally combined into scenario trees. The costs incurred from applying scenario-based optimization, either static or dynamic, to these airports is considerably higher than the theoretical optimization results suggest because actual capacities vary around the nominal values assumed in the optimization, and because of uncertainty in navigating scenario trees that the idealized models ignore. Methods for tuning capacity scenarios and scenario trees to mitigate these problems are explored. (c) 2008 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
Article Economics

Maximum capture problem based on paired combinatorial weibit model to determine park-and-ride facility locations

Songyot Kitthamkesorn, Anthony Chen, Seungkyu Ryu, Sathaporn Opasanon

Summary: The study introduces a new mathematical model to determine the optimal location of park-and-ride facilities, addressing the limitations of traditional models and considering factors such as route similarity and user heterogeneity.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2024)