期刊文献+

飞机滑行路径仿真与优化研究 被引量:4

Simulation and Optimization of Aircraft Sliding Path
下载PDF
导出
摘要 可变滑行时间是评估机场场面交通流特性的重要指标,影响机场运行效率、旅客满意度以及污染排放问题。针对国内某大型枢纽机场,根据元胞自动机原理和交通流拥塞规律,将机场滑行区域视作由节点和链路构成的网络拓扑,以滑行规则和飞机之间的冲突作为约束条件。构建飞机离场交通流的模型,使用蒙特卡洛算法得出最优滑行路径,结合航班数据进行仿真分析。研究结果表明,该模型减少了离港飞机的滑行等待时间,滑行效率提高了9.8%,充分调度和合理分配了机场地面资源。 Variable taxiing time is an important indicator to the characteristics of the airport traffic flow assessment, which affects the airport operating efficiency, the passenger satisfaction for the airline and the pollution emissions. For a large hub airport, according to the principle of cellular automata and the congestion of traffic flow, the airport taxiing area is regarded as the network topology of nodes and links, and the conflict between taxi rules and aircraft is taken as the constraint. The simulation analysis is carried out on the basis of constructing the model of airplane departure traffic flow, using Monte Carlo algorithm to get the optimal taxi path, combining the flight data. The results show that this model reduces the taxiing waiting time of the departing aircraft, and the taxiing efficiency is improved by 9.8%, and fully dispatches and rationally allocates airport ground resources.
作者 邢志伟 徐铭怡 罗晓 罗谦 Xing Zhiwei;Xu Mingyi;Luo Xiao;Luo Qian(College of Electronic Information and Automation,Civil Aviation University of China,Tianjin 300300,China;Engineering Technology Research Center,The Second Research Institute of CAAC,Chengdu 610041,China)
出处 《系统仿真学报》 CAS CSCD 北大核心 2020年第2期323-331,共9页 Journal of System Simulation
基金 国家自然科学基金(U1533203)
关键词 可变滑行时间 离港交通流 机场网络图 元胞自动机 蒙特卡洛算法 运行优化 variable taxiing time outbound traffic flow airport network diagram cellular automata Monte Carlo algorithm operational optimization
  • 相关文献

参考文献9

二级参考文献73

  • 1曹卫东,贺国光.连续航班延误与波及的贝叶斯网络分析[J].计算机应用,2009,29(2):606-610. 被引量:25
  • 2黎新华,张兆宁,王莉莉.基于跟驰稳定的终端区容量评估方法[J].系统工程理论与实践,2009,29(2):173-179. 被引量:12
  • 3高国政.基于蚁群算法的航空器地面滑行研究[J].山东交通科技,2011(1):24-27. 被引量:4
  • 4徐肖豪,臧志恒.基于MILP的飞机滑行排序的优化[J].交通与计算机,2007,25(2):142-145. 被引量:16
  • 5Arnott R, De Palma A, Lindsey R. Does providing information to drivers reduce traffic congestion? [ J ]. Transportation Research Part A, 1991, 25(5) : 309--318.
  • 6Ben-Akiva M, De Palma A, Kayasi I. Dynamic network models and driver information systems [ J]. Transportation Research Part A,1991, 25(5) : 251--266.
  • 7Karimi A, Hegyi A, De Schutter B, et al. Integrated Model Predictive Control of Dynamic Route Guidance Information Systems and Ramp Metering[ C]. IEEE Intelligent Transportation Systems Conference, Washington DC: 2004. 491---496.
  • 8Yamashita T, Izumi K, Kurumatani K. Car Navigation with Route Information Sharing for Improvement of Traffic Efficiency [ C ]. IEEE Intelligent Transportation Systems Conference, Washington DC ; 2004. 465-- 470.
  • 9Wunderlich K E, Kaufman D E, Smith R L. Link travel time prediction for decentralized route guidance architectures [ J ]. IEEE Transactions on Intelligent Transportation Systems, 2000, 1 (1) : 4--14.
  • 10Wu J H, Chen Y, Florian M. The continuous dynamic network loading problem: A mathematical formulation and solution method [ J ]. Transportation Research Part B, 1998, 32 ( 3 ) : 136--144.

共引文献145

同被引文献33

引证文献4

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部