1. 基于改进匈牙利算法的航路网络延误优化.
- Author
-
王莉莉 and 王航臣
- Subjects
- *
QUEUING theory , *TRAFFIC assignment , *TRAFFIC flow , *AIR flow , *AIR traffic , *ASSIGNMENT problems (Programming) - Abstract
Due to cope with relying on controllers badly and lacking of quantitative models to assist decision-making in air traffic flow management, this paper studied the delay optimization model and its solving algorithm for route network. Firstly, it established a traffic flow assignment model with the objective function of minimum flight time and capacity constraints. Secondly, considering that classical Hungarian algorithm was only suitable for small and medium-sized operations, it made the improvement of the calculation of efficiency matrix by making the maximum probability of the number of zero elements in the circle equal to the order of the efficiency matrix. Next, it constructed the cost function of the en-route by using the MIMIC queuing theory model. The function, which replaced the constant efficiency value in the efficiency matrix with a variable cost, made the efficiency matrix change with time and flow. Finally,it took part airspaces of China and the actual operational data of 2016 as examples. The results show that the algorithm can increase the access capacity by 8. 372% and the departure capacity by 8. 999%; In terms of delay optimization,it can reduce the average delay of each aircraft. In terms of algorithm performance, it has less iterations and less solution time than the classical Hungarian algorithm, and is more suitable for actual control operation. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF