基于禁忌退火算法的巡航导弹航迹规划

Route Planning of Cruise Missile based on Tabu Search-Simulated Annealing Algorithm

针对巡航导弹航迹规划这个复杂的优化问题,一个禁忌退火混合优化算法被提出。首先,该算法是以基本模拟退火算法为基础。其次,为了加快该模拟退火算法的收敛速度,在恶化解的接受判断过程中,增加了一定动态的约束条件。最后,为了使最优解能够跳出局部最优的陷阱,使用了一个动态的禁忌表。仿真结果验证了该禁忌退火混合优化算法能够取得目标函数更优的航迹规划路径,从而有效提高巡航导弹的作战效能。

To solve the route planning of cruise missile problem, a hybrid tabu search-simulated annealirig algorithm is proposed. The hybrid algorithm is based on a simple simulated annealing algorithm. And then, to improve the convergence speed of the simple simulated annealing algorithm, a dynamic constraint condition is considered during the selection of a solution of inferior quality. Finally, a dynamic tabu list is used in order that the solution can escape from local optimum. Simulation results indicate that the hybrid tabu search-simulated annealing algorithm can obtain a route with better objective function value, and the battle effectiveness of cruise missile is improved effectively.