Laser Antimissile Optimization Based on Very Fast Simulated Annealing Algorithm

Abstract

The dynamic laser antimissile problem is focused on with the very fast simulated annealing (VFSA) algorithm. The attacking ordering optimization plays an important role in the real-time application. This problem is much harder than the traveling salesman problem. There are many barriers for finding the global optimal solution, especially when the number of the targets is greater than six. The very fast simulated annealing algorithm is introduced here. And the fast simulated annealing (FSA) and classical simulated annealing (CSA) are also used to compare with the VFSA. Finally, taking ten targets as an example, the simulation results show that VFSA has faster convergence than those of the CSA and FSA. Therefore, the VFSA can be used in real-word application.