基于可变优先级的航班时隙排序

空中交通拥塞日益严重．这不仅带来大量的经济损失．同时给飞行安全带来隐患。地面等待策略作为短期措施中缓解交通拥塞的有效方法．其核心是如何解决时隙分配问题。传统的时隙分配算法（RBS和Compression算法）采用的是“先排班先服务”的原则，且没有考虑到航空公司的公平性。针对RBS和Compression算法的局限性．采用一种新的优先级设定方法，在同时考虑航空公司公平性、不同类型航班延误损失的不同、同类型航班载客量不同以及同一航班等待时间不同的基础上对航班进行优先级设定。采用分支定界法求解最优解。使用该算法对北京首都机场某个时间段内航班进行仿真排序结果显示：该改进算法在一定程度上提高时隙分配的合理性。减少航空公司的总延误损失．同时尽可能公平的保证航空公司所服务对象的利益。

Fights Slot Sort Based on Variable Priority

The air traffic congestion is growing, which not only brings a lot of economic loss, but also poses a potential threat to flight safety. Ground holding policy as short-term measures to alleviate traffic congestion, the core is how to solve the problem of slot allocation. Traditional slot alloca- tion algorithm （RBS and Compression algorithm） is scheduling service the principle of FCFS, and do not take into account the fairness of the airlines. The limitations of RBS and Compres- sion algorithm, the use of a new priority setting method, taking into account the fairness of the airlines, difference of different types of loss of flight delays, flight capacity of the same type and the same flight waiting time priority setting on the basis of different flights. Uses the branch and bound method for solving the optimal solution. Simulation Sort results show that： the improved algorithm to some extent reasonable time slot allocation, reducing the airline delay damages, as fair as possible to ensure the use of the algorithm for a certain period of time of the Beijing Capital Airport flights airlines serve the interests of the object.