Modified simulated annealing algorithm for laser antimissile problem

The dynamic laser antimissile problem is solved by the simulated annealing (SA) algorithm. The attacking sequence optimization plays an important role in the real-time application. When faced with multiple attacking targets, it is clearly important for the laser antimissile system to determine the sequence of the attacking targets to be intercepted so that the maximum attacking targets are destroyed. This problem is much harder than a pure traveling salesman problem. It is a dynamical shortest path problem. But there are many barriers for finding the global optimal solution, especially when the number of the targets is greater than six. The modified simulated annealing (MSA) algorithm is proposed here which considers the heating strategy. Finally, taking ten targets as an example, the simulation results show that MSA has better solution than that of SA and this achievement can be used in the real application.