基于Maklink图和遗传算法的改航路径规划方法研究  

A Re-routing Path Planning Method Based on Maklink Graph and GA Algorithm

作　　者：王飞[1] 王红勇[1] 

机构地区：[1]中国民航大学天津市空管运行规划与安全技术重点实验室,天津300300

出　　处：《交通运输系统工程与信息》2014年第5期154-160,共7页Journal of Transportation Systems Engineering and Information Technology

基　　金：国家自然科学基金与民航联合资助项目(U1333108);国家科技支撑计划资助项目(2011BAH24B08);中央高校基本科研业务费专项基金资助项目(ZXH2011A002;ZXH2012C005);中国民航大学科研启动基金项目(2011QD01X)

摘　　要：为了保障恶劣天气下的飞行安全,航班需要采取改航策略避开危险区.采用已有的以改航路径最短为目标,以航段最小距离、避开危险区、转弯角度等为约束条件的规划模型,设计了3阶段方法研究改航路径规划.首先应用Maklink图和Dijkstra算法规划一条能够避开危险区的路径,接着应用遗传算法优化路径,最后进行路径调整以满足约束条件.算例仿真结果显示,应用本文方法得到的改航路径长度较短,转弯次数少、转弯角度小,计算效率高.仿真结果说明,应用本文提出的方法获得的改航路径满足目标和约束要求,验证了该方法的可行性和有效性.To ensure flight safety in severe weather, it is necessary to design the optimized route for aircrafts to avoid the dangerous zone. An optimization model is established. Considering several constraints, such as avoiding danger zone, reducing flight segment minimum length, turning angle and turning point number, the model minimizes the total flight path length. After that, a three-stage-method is proposed to solve this model. First, the Maklink graph and the Dijkstra algorithm are used to obtain one flight path to avoid the danger zone. Second, genetic algorithm is applied to optimize the path to obtain the shortest path. Finally, the path is adjusted to satisfy all of the constraints. With the model and method above,several simulation experiments are carried out. Simulation results show that the proposed rerouting path planning method is feasible and effective.

关 键 词：航空运输 Maklink图 遗传算法 DIJKSTRA算法 改航路径规划 民航 

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