Research On Dynamic Air Traffic Assignment In Airspace Of Regional Control Under The Flexible Use Of Airspace

With the rapid development of China's air transport industry,the traffic flow is increasing,and the problem of route congestion is gradually emerging.Route congestion is becoming a bottleneck restricting the development of China's civil aviation transportation industry.The flexible use of airspace has become the key to solve the method of route congestion,and air flow dynamic distribution method,will make the crowded flight flow be assigned to other non congested routes,so as to achieve safe and efficient flow of air traffic.In this paper,the following studies are carried out on the dynamic allocation of airspace flow in regional control.First,the traffic flow distribution model is divided into two kinds: traffic aggregation and traffic dispersion.Flow convergence is divided into the same level of flow convergence and flow across the height of convergence.Flow distribution is divided into the same level of flow dispersion and flow across the height of the dispersion.Second,there may be a number of restricted airspace affected by dangerous weather,military activities and other factors.Taking the optimal flight cost as the objective function,taking route capacity as constraint condition,and taking the number of flights in the region and the number of waiting flights outside the region as planning variable,build a planning model of dynamic traffic assignment.And Floyd algorithm is used to calculate the shortest range in the region.And comparing the operating costs before and after dynamic flow distribution.Finally,the model is simulated by AirTop software.Third,the multi-objective programming model based on the dynamic traffic assignment is established by taking the minimum length of route length and the minimum delay time,and the minimum value of the load balance of the route network in each layer.Linear weighted method is used to solve the multi-objective programming model.The flight flow is assigned to the optimal level and the optimal route.