摘要
应用基本蚁群算法解决反舰导弹航路规划问题,会有收敛速度慢、计算时间长、易于过早陷入局部最优等缺点。针对该问题,引入轮盘式选择策略、精英策略以及路径优化策略对传统蚁群算法进行优化,并将优化算法应用于反舰导弹航路规划中;同时通过对反舰导弹的可行航向进行限定,缩小了航路规划的最大搜索范围。仿真实验表明,基于优化蚁群算法的反舰导弹航路规划不仅缩短了最优航路长度,而且提高了最优航路搜索过程的收敛速度。
Application of the basic ant colony algorithm for anti-ship missile path planning problem has such shortcomings as slow convergence speed, long computation time, and easily falling into local optimum. Concerning these shortcomings, roulette selection strategy, elite strategy and path optimization strategy were adopted on traditional ant colony algorithm to optimize it, and the optimization algorithm was applied in anti-ship missile route planning. At the same time, by means of limiting the feasible course of anti-ship missile, the maximum search range for route planning was reduced. Simulation results show that the anti-ship missile route planning based on improved ant colony algorithm not only shortens the optimal route length but also speeds up the convergence rate of the optimal route search process.
出处
《计算机应用》
CSCD
北大核心
2012年第9期2530-2533,2541,共5页
journal of Computer Applications
关键词
反舰导弹
航路规划
蚁群算法
轮盘式选择策略
精英策略
路径优化策略
anti-ship missile
route planning
ant colony algorithm
roulette selection strategy
elitist strategy
path optimization strategy
