检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《大连交通大学学报》2011年第6期41-45,共5页Journal of Dalian Jiaotong University
基 金:国家自然科学基金资助项目(60979021/F01)
摘 要:针对各大型机场容量不足导致地面滑行延误日益严重的难题,结合空中交通管制与机场地面滑行基本规则,提出了一种新的调度策略,将停机位或跑道入口无限时等待时间分散到滑行过程中的各个结点,并建立了求解该问题的混合整数规划模型.此外,将最短路与理想路径进行区分,采用Floyd算法为每架飞机提供多条无障碍的理想路径.通过某大型机场的实际数据进行验证分析,结果表明新的调度策略可以使得总调度时间减少,缓解机场的地面忙碌状态.In order to resolve the increasingly serious taxiing delays problems caused by inadequate capacity at major airports, a new scheduling strategy is proposed according to air traffic control and airport ground taxiing basic rules, in which the waiting time on runway or in the stands is distributed to each node in the process of taxiing. A mixed integer programming model is established to solve this problem, and the ideal path and the shortest path is distinguished using Floyd algorithm to find out several ideal paths for each aircraft. The model is proven through actual data analysis from a large airport, and the results show that the new scheduling strategy can reduce the total scheduling time and relieve the busy state in large airport.
关 键 词:机场滑行道调度 混合整数规划 FLOYD算法 理想滑行路径
分 类 号:V355[航空宇航科学与技术—人机与环境工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249