期刊文献+

危险天气下航路网络流可靠性的动态管理 被引量:2

Dynamic management of en-route network flow reliability in dangerous weather
下载PDF
导出
摘要 为缓解危险天气对繁忙机场造成的空域压力,对空中交通可靠性管理的预分流问题展开研究。针对危险天气随机性变化的问题,提出了航路可靠性的度量方法,并通过数学变换将航空危险天气的随机性转化为航路网络的阻抗;根据管制实际运行条件改进了最小费用最大流模型,提出了一种考虑航路阻抗随天气动态变化、航路容量约束和管制员负荷约束的可靠性数学模型。以华北管制区的部分空域为例进行仿真分析,结果表明:该方法对流量大的机场优化效果明显,北京首都国际机场的飞机离场延误降低12.44%,天津滨海机场的离场延误降低11.98%。 To alleviate the airspace congestion caused by dangerous weather in busy airports,the pre-distribution in air traffic reliability management is studied.Aiming at the random change of dangerous weather,firstly,the measurement of route reliability is proposed,and the random change is transformed into the impedance of the network by mathematical transformation.Secondly,the minimum-cost-maximum-flow model is improved based on actual ATC operating conditions,building a mathematical model which consists of dynamic variation of the impedance,capacity constraints and controller load constraints.Finally,part airspace in North China Control Area is taken as simulation instance and results show that the model and algorithm can effectively optimize the traffic control in large flow airport.The flight delay of ZBAA is decreased by 12.44%,and the departure delay of ZBTJ is decreased by 11.98%.
作者 王莉莉 王航臣 赵迪 李彦吉 WANG Lili;WANG Hangchen;ZHAO Di;LI Yanji(ATM Operation Planning and Safety Techniques Key Lab of Tianjin,CAUC,Tianjin 300300,China;School of Traffic and Transportation,Beijing Jiaotong University,Beijing 100044,China;Hebei Provincial Administration Bureau of Transport,Shijiazhuang 050000,China;Shijiazhuang Section for Power Supply,Beijing Railway Bureau,Shijiazhuang 056002,China)
出处 《中国民航大学学报》 CAS 2019年第6期1-5,共5页 Journal of Civil Aviation University of China
基金 国家自然科学基金项目(U1633124,41501430)
关键词 空中交通流量管理 危险天气 最小费用最大流模型 航路网络 air traffic flow management dangerous weather minimum-cost maximum flow model en-route network
  • 相关文献

参考文献7

二级参考文献52

  • 1周玉林,郑建秀.快速排序的改进算法[J].上饶师范学院学报,2001,21(6):11-15. 被引量:8
  • 2秦绪林.如何充分发挥雷达管制的优势[J].中国民用航空,2007(4):69-70. 被引量:4
  • 3李雄,徐肖豪,王超,等.基于凸多边形的飞行改航区划设及路径规划研究[C]//中国控制与决策会议.2008:3083-3088.
  • 4Corley H W, Sha D Y. Most vital links and nodes in weighted networks[J]. Operations research letters, 1982,1(4), 157~160.
  • 5Malik K, Mittal A K, Gupta S K. The most vital arcs in the shortest path problem[J]. Operations Research Letters,1989, 8(8): 223~227.
  • 6Bar N A, Khuller S, Schieber B. The complexity of finding most vital arcs and nodes[R]. Technical Report CS-TR-3539, Institute for Advanced Studies, University of Maryland, 1995.
  • 7Nardelli E, Proietti G, Widmayer P. Finding the detour-critical edge of a shortest path between two nodes[J].Information Processing Letters, 1998, 67(1): 51~54.
  • 8Nardelli E, Proietti G, Widmayer P. Finding the most vital node of a shortest path [J]. Lecture Notes in Computer Science2108, 2001: 278~287.
  • 9Ahn J, Chung H, Park S. Determining the arc's ranking in minimum cost flow problem [J]. Theoretical Computer Science, 2003, 296(1): 167~177.
  • 10Lubore S H, Ratliff H D, Sicillia G T. Determining the most vital link in a flow network[J]. Naval Research Logistics Quarterly, 1971, 18(4): 711~713.

共引文献56

同被引文献16

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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