Route Planning of Cruise Missile based on Tabu Search-Simulated Annealing Algorithm
Jin An Xu · Fire Control and Command Control · 2009
To solve the route planning of cruise missile problem,a hybrid tabu search-simulated annealing 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.