基于改进蚁群算法的改航路径规划

Rerouting Planning Based on Improved Ant Colony Algorithm

鉴于传统改航路径规划方法目标单一、计算复杂的问题,文中提出了一种基于改进蚁群算法的多目标航班改航路径规划算法。首先在初始化时使信息素与到终点的距离相关联;然后在蚂蚁移动时采用约束规则建立个体解;最后在得到蚁群算法优化的路径后,运用文中介绍的优化算子再次进行优化。最终在块状和离散状飞行限制区下进行仿真实验。结果表明改进的蚁群算法明显优于其他算法,能得到改航点少,偏移量小,路径短的航线。

As traditional rerouting methods are complex and single-targeted, a multi-objective rerouting algorithm based on improved ant colony algorithm is proposed. Firstly, when initializing the algorithm, associate the pheromone with destination distance, then establish the individual solution with constraint role during ant moving time, finally apply the optimizing operator introduced to the re-optimization af- ter obtaining the optimized route with ant colony algorithm. The simulation tests are carried out within the massive and dispersed restricted areas. It has turned out that the improved ant colony algorithm which provides route with lest turning points, smaller deflection and shorter path is more excellent than other algorithms distinctly.