基于改进蚁群算法的潜艇最短航路规划

提出了一种将潜艇的航路规划问题转化为多阶段最短路径问题的模型,和最短路径问题的威胁度加权算法,并使用蚁群算法来计算最短路径,达到求解潜艇航路规划问题的目的.还针对现有的蚁群算法收敛速度慢的缺陷提出了一种蚂蚁学习策略,同时对现有算法的信息素更新策略进行了改进.最后的实验比较得出,改进后的蚁群算法收敛速度与成功率相比传统蚁群算法有了明显提高.

Research on submarine routing planning based on improved ant colony algorithm

Present a model to convert submarine routing planning problem to multi-stage shortest path problem, at the same time present a algorithm to add a threaten factor to the shortest path problem, and use ant colony algorithm to find the best path in order to solve the submarine routing planning problem. Present an ant learning scheme to accelerate the converge speed comparing with existing ant colony algorithm, as well as improve the pheromone up- date scheme. As the experiment result, the improved algorithm has a faster converge speed and a higher rate of suc- cess than the previous algorithm.