基于改进Dijkstra算法的滑行路径优化  

Optimization of taxiway based on improved Dijkstra algorithm

作　　者：翟文鹏[1] 刘润南 朱承元[1] ZHAI Wenpeng;LIU Runnan;ZHU Chengyuan(College of Air Traffic Management,CAUC,Tianjin 300300,China)

机构地区：[1]中国民航大学空中交通管理学院,天津300300

出　　处：《中国民航大学学报》2022年第1期1-6,共6页Journal of Civil Aviation University of China

基　　金：国家自然科学基金青年科学基金项目(61603396)。

摘　　要：为了减少大型繁忙机场场面拥堵与航班延误,对处于机场终端区的航班进行预先战术性的滑行路径动态优化。首先,对处于机场终端区的航班划分时间窗口,对航班集合进行分类,使用改进Dijkstra算法对需要路径优化的航班进行动态规划。改进Dijkstra算法是将整个时间进程分成多个连续滚动的时间片,在每个时间片中,以场面节点的时间当量长度总和最小为优化目标,采用传统Dijkstra算法思想,获得每个航班的最优滑行路径解。其次,在TAAM(total airspace and airport modeller)仿真软件中利用Matlab编程实现算法,并以实际机场为例验证算法正确性。实验结果证明:改进Dijkstra算法能有效减少滑行冲突,提高滑行效率,缩短机场航班延误时间。In order to reduce the congestion and flight delay of large busy airports, the strategic dynamic optimization of flights taxiway in the terminal area of airport is carried out. Firstly, the time windows of the flights in the terminal area of the airport are divided, the flight sets are classified, and the improved Dijkstra algorithm is used to dynamically plan the flights that need path optimization. The improved Dijkstra algorithm divides the whole time process into several continuous rolling time slices. In each time slice, the solution to taxiway optimization of each flight is obtained by using the traditional Dijkstra algorithm with the objective of minimizing the sum of time equivalent length of scene nodes. Secondly, the algorithm is implemented by Matlab in total airspace and airport modeller(TAAM) simulation software, and the correctness of the algorithm is verified by an actual airport. The experimental results show that the improved Dijkstra algorithm can effectively reduce the taxiing conflict,improve the taxiing efficiency and shorten the airport flight delay time.

关 键 词：空中交通管制 机场管制 改进DIJKSTRA算法 滑行路径优化 TAAM(total airspace and airport modeller)仿真 

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