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.
Optimal Arrival Traffic Spacing via Dynamic Programming
2004
9 pages
Report
No indication
English
Operations Research , Navigation Systems , Aircraft landings , Air traffic control systems , Arrival , Optimization , Traffic , Embedded systems , Configurations , Perturbations , Combinatorial analysis , Dynamic programming , Symposia , Simulation , Algorithms , Problem solving , Fast-time simulation , Arrival spacing
Optimal Arrival Traffic Spacing via Dynamic Programming
AIAA | 2004
|AIAA-2004-5228 Optimal Arrival Traffic Spacing via Dynamic Programming
British Library Conference Proceedings | 2004
|Arrival Traffic Scheduling System Incorporating Equipage-Dependent In-Trail Spacing
European Patent Office | 2015
|Arrival Traffic scheduling system incorporating equipage-dependent in-trial spacing
European Patent Office | 2016
|