We present the application of dynamic programming to a combinatorial optimization problem to achieve proper arrival runway spacing, which appears in the process of assigning speed during the transition to approach and approach phases of flight. We apply the algorithm to data from a fast-time simulation developed under NASA's Advanced Air Transportation Technologies Project for investigating new air traffic management (ATM) concepts. For this research, the simulation is configured to simulate traffic inbound along two arrivals to the Dallas/Ft. Worth (DFW) airport, merging into a single stream at fix just prior to the final approach fix. We show how the algorithm computes the maximum minimum spacing between aircraft upon landing, and investigate the sensitivity of the spacing to perturbations.
No takes yet. Share an insight, caveat, or question.
Bayen et al. (2004) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: