Equitable and Efficient Coordination in Traffic Flow Management

Abstract

When air traffic demand is projected to exceed capacity, the Federal Aviation Administration implements traffic flow management (TFM) programs. Independently, these programs maintain a first-scheduled, first-served invariant, which is the accepted standard of fairness within the industry. Coordinating conflicting programs requires a careful balance between equity and efficiency. In our work, we first develop a fairness metric to measure deviation from first-scheduled, first-served in the presence of conflicts. Next, we develop an integer programming formulation that attempts to directly minimize this metric. We further develop an exponential penalty approach and show that its computational performance is far superior and its tradeoff between delay and fairness compares favorably. In our results, we demonstrate the effectiveness of these models using historical and hypothetical scenarios. Additionally, we demonstrate that the exponential penalty approach exhibits exceptional computational performance, implying practical viability. Our results suggest that this approach could lead to system-wide savings on the order of $25 to $50 million per year.