Theses and Dissertations from UMD >
UMD Theses and Dissertations >
Please use this identifier to cite or link to this item:
|Title: ||Coordinated and robust aviation network resource allocation|
|Authors: ||Churchill, Andrew Michael|
|Advisors: ||Lovell, David J|
|Department/Program: ||Civil Engineering|
|Sponsors: ||Digital Repository at the University of Maryland|
University of Maryland (College Park, Md.)
air traffic flow management, air transportation, integer programming, resource allocation
|Issue Date: ||2010|
|Abstract: ||In the United States, flight operators may schedule flights to most airports at whatever time best achieves their objectives. However, during some time periods, both at airports and in the airspace, these freely-developed schedules may become infeasible because weather or other factors reduce capacity. A plan must then be implemented to mitigate this congestion safely, efficiently, and equitably. Current planning processes treat each congested resource independently, applying various rules to increase interoperation times sufficiently to match the reduced capacity. However, several resources are occasionally congested simultaneously, and ignoring possible dependencies may yield infeasible allocations for flights using multiple resources.
In this dissertation, this problem of developing coordinated flight-slot allocations for multiple congested resources is considered from several perspectives. First, a linear optimization model is developed. It is demonstrated that optimally minimizing flight arrival delays induces an increasing bias against flights using multiple resources. However, the resulting allocations reduce overall arrival delay, as compared to the infeasible independent allocations, and to current operational practice. The analytic properties of the model are used to develop a rule-based heuristic for allocating capacity that achieves comparable aggregate results. Alternatively, minimizing delay assigned at all resources is considered, and this objective is shown to mimic the flights' original schedule order.
Recognizing that minimizing arrival delays is attractive because of its tangible impact on system performance, variations to the original optimization model are proposed that constrain the worst-case performance of any individual user. Several different constraints and cost-based approaches are considered, all of which are successful to varying degrees in limiting inequities.
Finally, the model is reformulated to consider uncertainty in capacity. This adds considerable complexity to the formulation, and introduces practical difficulties in identifying joint probability distributions for the capacity outcomes at each resource. However, this new model is successful in developing more robust flight-slot allocations that enable quick responses to capacity variations.
Each of the optimization models and heuristics presented here are tested on a realistic case study. The problem studied and the approaches employed represent an important middle ground in air traffic flow management research between single resource models and comprehensive ones.|
|Appears in Collections:||UMD Theses and Dissertations|
Civil & Environmental Engineering Theses and Dissertations
All items in DRUM are protected by copyright, with all rights reserved.