基于“三区”限制的航路优化  

Route Optimization Based on"Three Zones"Circumvention

作　　者：石新鹏 SHI Xin-peng(College of Air Traffic Control,Civil Aviation University of China,Tianjin 300000,China)

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

出　　处：《航空计算技术》2020年第2期27-31,共5页Aeronautical Computing Technique

基　　金：国家自然科学基金项目资助(71701202,U1333116);中央高校基本科研业务费专项资金项目资助(3122017061)。

摘　　要：航路网络优化问题的一个子问题就是航路网络生成后,在有“三区”限制的条件下,固定节点之间避开“三区”生成优化航路的问题。建立了以路径长度最短为目标函数,规避PRD空域为限制的航路优化模型,通过栅格法处理可用空域,分析并总结了不同算法求解优化模型的优势与不足并提出改进方法,得到了较为满意的结果。One of the sub-problems of the route network optimization problem is that after the route network is generated,under the condition of"three zones"circumvention,the fixed nodes avoid the"three zones"to generate the optimized route.In this paper,a route optimization model with the shortest path length as the objective function and avoiding the limitation of PRD airspace is established.The available space is processed by grid method,the advantages and disadvantages of different algorithms for solving the optimization model are analyzed and summarized,and the improved methods are put forward,and the satisfactory results are obtained.

关 键 词：“三区”限制 栅格法 航路优化 A*算法优化 元胞自动机 直线优化 

分 类 号：O224[理学—运筹学与控制论]