Title page for ETD etd-03282008-123153


Type of Document Dissertation
Author Henderson, Jeffrey Michael
Author's Email Address jmhender@vt.edu
URN etd-03282008-123153
Title Collaborative En Route Airspace Management Considering Stochastic Demand, Capacity, and Weather Conditions
Degree PhD
Department Civil Engineering
Advisory Committee
Advisor Name Title
Trani, Antoino A. Committee Chair
Baik, Hojong Committee Member
Flintsch, Gerardo W. Committee Member
Koelling, Charles Patrick Committee Member
Rakha, Hesham Ahmed Committee Member
Keywords
  • Thunderstorms
  • Airspace
  • Equity
  • Air Traffic Control
  • Simulation
Date of Defense 2008-03-26
Availability unrestricted
Abstract
The busiest regions of airspace in the U.S. are congested during much of the day from traffic volume, weather, and other airspace restrictions. The projected growth in demand for airspace is expected to worsen this congestion while reducing system efficiency and safety. This dissertation focuses on providing methods to analyze en route airspace congestion during severe convective weather (i.e. thunderstorms) in an effort to provide more efficient aircraft routes in terms of: en route travel time, air traffic controller workload, aircraft collision potential, and equity between airlines and other airspace users. The en route airspace is generally that airspace that aircraft use between the top of climb and top of descent.

Existing en route airspace flight planning models have several important limitations. These models do not appropriately consider the uncertainty in airspace demand associated with departure time prediction and en route travel time. Also, airspace capacity is typically assumed to be a static value with no adjustments for weather or other dynamic conditions that impact the air traffic controller. To overcome these limitations a stochastic demand, stochastic capacity, and an incremental assignment method are developed. The stochastic demand model combines the flight departure uncertainty and the en route travel time uncertainty to achieve better estimates for sector demand. This model is shown to reduce the predictive error for en route sector demand by 20\% at a 30 minute look-ahead time period.

The stochastic capacity model analyzes airspace congestion at a more macroscopic level than available in existing models. This higher level of analysis has the potential to reduce computational time and increase the number of alternative routing schemes considered. The capacity model uses stochastic geometry techniques to develop predictions of the distribution of flight separation and conflict potential. A prediction of dynamic airspace capacity is calculated based on separation and conflict potential.

The stochastic demand and capacity models are integrated into a graph theoretic framework to generate alternative routing schemes. Validation of the overall integrated model is performed using the fast time airspace simulator RAMS. The original flight plans, the routing obtained from an integer programming method, and the routing obtained from the incremental method developed in this dissertation are compared. Results of this validation simulation indicate that integer programming and incremental routing methods are both able to reduce the average en route travel time per flight by 6 minutes. Other benefits include a reduction in the number of conflict resolutions and weather avoidance maneuvers issued by en route air traffic controllers. The simulation results do not indicate a significant difference in quality between the incremental and integer programming methods of routing flights around severe weather.

Files
  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  Henderson_Dissertation_CEE_2008.pdf 4.40 Mb 00:20:22 00:10:28 00:09:10 00:04:35 00:00:23

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.