空中交通流量管理包括战略管理和战术管制两个方面。如何对等待降落的航班重新排序 ,使得在等待队列中所有航班的地面等待和空中等待成本总和最小是进近区域流量战术管制的主要研究内容之一。本文对目的机场的飞机降落时间问题进行了系统地分析 ,并利用互换理论对问题进行了推导与建模 ,得出了被动空中交通流量管理中的动态排序算法。该算法与目前国内外一般算法不同 ,计算时不直接使用机场的容量约束 ,而是利用与容量相关的统计航班服务时间随机变量 ,避免了机场容量取整带来的剩余时间误差。这是本文所提算法的重要优点之一。经仿真验证了算法的可行性 Air traffic flow management includes strategic management and tactical control. How to reorder the flights waiting for the landing so that the sum of the floor waiting and air waiting costs of all the flights in the waiting queue is a minimum is one of the main research contents of the tactics of traffic tactics in the approach area. This paper systematically analyzes the landing time of aircraft at the destination airport, and uses the exchange theory to deduce and model the problem. The dynamic ranking algorithm in passive ATFM is obtained. This algorithm is different from the current domestic and foreign general algorithms. Instead of directly using the capacity constraint of the airport, the algorithm uses the random variables related to the capacity of the statistical flight service to avoid the remaining time error caused by the rounding of the airport capacity. This is one of the important advantages of the proposed algorithm. The simulation shows the feasibility of the algorithm