摘要
针对枢纽机场滑行道容量不足问题,结合安全间隔、冲突解脱和公平性原则,以滑行路径最短作为优化目标,考虑燃油消耗和废气排放,建立滑行路径规划模型。采用Dijkstra算法将滑行路径转化为邻接矩阵,以加权的方式进行冲突解脱,在保证滑行道零冲突的前提下,减少总的滑行距离。以国内某枢纽机场2018年某日18:00—19:00内的实际运行数据结合19个跑道节点、71个滑行道节点进行验证分析。结果表明,提出的滑行路径规划方法可行,可提高机场场面滑行效率,有效降低油耗量及污染物排放。
Aiming at the problem of the insufficient capacity of taxiway in hub airport,based on the principles of safety interval,conflict resolution and fairness,the shortest taxiing path is taken as the optimization goal,and the taxiing path planning model is established considering fuel consumption and exhaust emission.The Dijkstra algorithm is used to transform the taxiing path into an adjacency matrix,and the conflict is solved in a weighted manner.Under the premise of ensuring zero conflict on the taxiway,the total taxiing distance is reduced.The actual operation data of a hub airport in China from 18:00 to 19:00 on a certain day in 2018 were combined with 19 runway nodes and 71 taxiway nodes for verification and analysis.The results show that the proposed taxiing path planning method is feasible,which can improve the taxiing efficiency of the airport surface and effectively reduce fuel consumption and pollutant emissions.
作者
祁欣月
张汛
陈长煜
张涛
QI Xinyue;ZHANG Xun;CHEN Changyu;ZHANG Tao(School of Technology,Tibet University,Lasa 850000,Tibet,China;Unit 96951,Beijing 100085,China)
出处
《科技和产业》
2024年第9期201-207,共7页
Science Technology and Industry
基金
西藏自治区自然科学基金重点项目(XZ202201ZR0040G)。