基于可变优先级的GHP时隙分配优化模型  

Ground-Holding Model of the Slot Assignment Based on Changeable Priority

作　　者：彭莉娟[1] 康瑞[1] 王冬磊[1] 牟丽莎[2] 刘洪[1] 

机构地区：[1]四川大学计算机学院,成都610064 [2]四川工程职业技术学院,德阳618000

出　　处：《系统仿真学报》2010年第1期25-28,共4页Journal of System Simulation

基　　金：国家自然科学基金(60705005;60736046);博士点基金(20070610031);863项目基金(2006AA12A104)

摘　　要：空中交通拥塞日益严重,造成大量经济损失。作为短期措施中缓解空中交通拥塞的有效方法,地面等待策略(GHP)的核心问题是时隙分配。因此针对航班的延误时间和延误费用,提出了一种可变优先级的时隙分配算法,并建立基于该算法的GHP优化模型。该算法中,航班在竞争不同时隙时优先级不同,且优先级的计算同时考虑了航班的延误时间和延误费用的影响,最后采用分支定界法搜索时隙分配的最优解。结合实际的数据,用计算机仿真实验对该算法进行了检验,结果表明了该算法的灵活性和有效性。The growing problem of air traffic congestion caused a great number of economic losses. Since the kernel technology of Ground-Holding Policy （GHP）, which was an effective method of those short-term measures to relieve the air traffic congestion, would be the slot assignment, the Priority-Based Slot Assignment Algorithm in which the delay cost and delay time of the flights were considered was proposed. In this algorithm, the flights would have different priorities when competing for the slot, and the influences of the delay cost and delay time of the flights was also considered in the calculation of those priorities, then using branch and bound method to search for the optimized solution. With real data, the algorithm ran effectively and efficiently in the computer simulation experiment, which indicates the flexibility and practicability and validity of this algorithm.

关 键 词：地面等待策略 时隙分配 权重 可变优先级 

分 类 号：V355[航空宇航科学与技术—人机与环境工程]