论文部分内容阅读
为解决拥挤空域的资源分配问题,针对航班对计划到达时间变动范围的接受程度不同,定义了航班的延误成本函数,建立了一个基于航班有限到达时间窗的0-1整数规划模型,实现空域资源的最优分配,并开发了以匈牙利算法为核心的程序用于模型求解.以某机场运行数据为例进行仿真实验,结果表明,本文模型的最优解较先到先服务策略(FCFS)的分配结果能降低航班延误成本116%,并且其分配方案能满足每个航班可接受的到达时间窗约束.
In order to solve the problem of resource allocation in crowded airspace, a flight delay cost function is defined according to the different degree of acceptance of the flight to the planned arrival time. A 0-1 integer programming model based on the limited arrival time window is established, , And developed a program based on the Hungarian algorithm to solve the model.Using a certain airport operation data as an example, the simulation results show that the optimal solution of this model is better than the first-served model (FCFS) Allocation results reduce flight delay costs by 116% and their allocation scheme meets the acceptable time window constraints for each flight.