基于航班到达时间窗约束的空域资源分配问题  

Airspace resource allocation under limited arrival time windows of flights

作　　者：刘方勤[1] 胡明华[1] 杨尚文[1] 

机构地区：[1]南京航空航天大学,江苏南京210016

出　　处：《系统工程学报》2011年第4期485-491,共7页Journal of Systems Engineering

基　　金：国家863计划重点资助项目(20060AA12A105);国家空管科研课题资助项目(GKG200802006)

摘　　要：为解决拥挤空域的资源分配问题,针对航班对计划到达时间变动范围的接受程度不同,定义了航班的延误成本函数,建立了一个基于航班有限到达时间窗的0-1整数规划模型,实现空域资源的最优分配,并开发了以匈牙利算法为核心的程序用于模型求解.以某机场运行数据为例进行仿真实验,结果表明,本文模型的最优解较先到先服务策略(FCFS)的分配结果能降低航班延误成本116%,并且其分配方案能满足每个航班可接受的到达时间窗约束.This paper studied an airspace resource allocation problem for congested flights, in which the flights have the different arrival time limitations. Firstly, some delay cost functions of flights were defined. Secondly, a binary integer programming model for assigning slot resources was established with limited arrival time windows. Thirdly, Hungarian algorithm was applied to solving the model. Finally, an experiment was performed in which the model was applied to optimizing the slot-allocation for an airport. Compared the optimized results using the proposed model and those using the FCFS（first-come-first-service） tactic, the proposed model could reduce the delay costs by 116% and satisfy the different arrival time requirements of different flights.

关 键 词：空中交通管理 空域时隙分配 约束时间窗 匈牙利算法 

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