Study On The Route Dynamic Programming Model And Algorithm

Limited airspace resource is the main cause of flight delays. Route dynamic programming technology can help aircraft bypass the airspace which is needed to avoid by diverting strategies. Thus it improves the airspace utilization, reduces the flight delay rate, and increases the efficiency of the airline.Firstly, some basic theories related to route dynamic programming were overviewed. These theories included the concepts of route planning, diverting path planning and route choice. The flight environment of aircraft and the impacts on flight brought by unexpected weather were detailed analyzed. Finally, several kinds of algorithms of route planning commonly used were summarized.Secondly, to solve the route selection problem under delay, the influencing factors of route choice were analyzed. Then from the angle of enabling temporary routes, a mathematical model of flights gathered in the intersection was established on the target of minimizing the total delay time. The related algorithm was designed to simulate different example simulation scenarios. The simulation results show that the method can solve an optimal route selection scheme for multiple flights and the total delay time of this scheme is the minimum.Then, for the diverting path planning problem under abrupt weather, the diverting strategy was analyzed. Then according to the characteristics of unexpected weathers and the impacts on flight brought by the weathers, two diverting ways including diverting on the same level and diverting changing altitude were respectively discussed. The corresponding threat probability models and improved diverting models were proposed respectively. The diverting path planning analyses under different dynamic weather conditions were given. Based on the thought of shortest total voyage, the heuristic algorithm steps, procedures and different simulation scenarios were designed. Finally the results prove that two diverting ways are feasible and valid.Finally, for diverting problem in flight conflicts, the meaning, classification and avoidance measures of flight conflict were introduced. Then the aircraft which had right during confliction was seen as a threat that was dynamically moving along scheduled route. The aircraft’s reserve was seen as threat area. The threat probability model or conflict probability model and conflict diverting model were proposed. According to categories of flight conflicts, the optimal diverting paths were analyzed. The process of heuristic algorithm and simulation scenarios were designed to prove that this method can effectively solve this problem.