A pairing algorithm for landing aircraft to closely spaced parallel runways

Abstract

To facilitate pairing of aircraft while meeting a schedule, the pair-scheduling problem for landing aircraft in Very Closely Spaced Parallel Approaches was studied. An earlier prototype was adopted and the scheduling algorithm was extended in several ways to improve the solution quality and expand the range of constraints it could handle. This paper presents the scheduling problem formulation, as well as enhancements made to an earlier prototype that made it suitable for application in a human-in-theloop simulation carried out recently at NASA Ames Research Center. Experimental data from the simulations as well as an extensive set of stress tests are analyzed and discussed. Results suggest the algorithm succeeded in suggesting aircraft pairs acceptable to the air traffic controllers in over 97% of the cases. Evaluating the performance and scalability characteristics of the algorithm demonstrates its effectiveness in discovering feasible aircraft pairs that meet all the sequencing, separation, pair-group, and runway assignment constraints. Overall, the high solution quality and short runtime makes the proposed algorithm a suitable and attractive candidate for use in a real-time aircraft-pairing application.

Scheduling Aircraft Take-Offs and Landings on Interdependent and Heterogeneous Runways

“…There is recent technical progress that will probably increase the capacity of existing runway systems: (1) there are efforts to adjust the separation requirements to the current wind situation (NATS, 2014); (2) for landings on closely spaced parallel runways, some papers present an aircraft pairing approach, i.e., aircraft are scheduled to land in staggered pairs to avoid the other aircraft's wake vortex (Kupfer, 2009;Farrahi and Verma, 2010). The presented DP approach could also be generalized to implement other aircraft sequencing approaches like, e.g., Constrained Position Shifting, or other heuristic approaches than RPH.…”