Discussion and Comparison of Metroplex-Wide Arrival Scheduling Algorithms

Abstract

This paper discusses three candidate metroplex-wide arrival scheduling algorithms that are aimed at improving the efficiency of and the coordination between arrival operations in a metroplex environment. We present analysis results obtained by applying the candidate algorithms to a generic metroplex model. Four different metroplex-boundary fix configurations were studied in this process. However, in this paper, we elaborate differences between the algorithms and present a comparison of their performance as applied to one of these boundary fix configurations. Initial results show that scheduling strategies, which try to minimize the impact of upstream constraints on individual airport runway utilization while trying to optimize crossing sequences at all key upstream scheduling points and the runway at the same time, provide the most benefits in terms of minimizing delay and fuel cost impacts of metroplex interactions. I. Introduction Federal Aviation Administration (FAA), the Joint Planning and Development Office (JPDO) and others have projected a significantly increased demand over the timeframe of the Next Generation Air Transportation System (NextGen). It is expected that much of future National Airspace System (NAS) air traffic demand growth will be in major metropolitan areas. In today’s NAS, metropolitan areas with high demand are often served by a group of two or more airports whose arrival and departure operations are highly interdependent. Such a group is defined as a “metroplex” by the JPDO [JPDO]. The resulting traffic growth in metropolitan areas will increase the coupling of operations in the metroplexes that already exist, increase expected NAS delays, and will potentially create new metroplexes.