Permutation Algorithm with Simulated Annealing for Laser Antimissile Problem

Abstract:

Article Preview

The permutation algorithm with simulated annealing is proposed for the laser antimissile problem. The attacking sequence optimization plays an important role in the real-time laser antimissile problem. When faced with many targets, it is clearly essential for the laser antimissile system to determine the sequence of the attacking targets. In order to maximize attacking targets are destroyed. This paper presents a permutation algorithm based on the simulated annealing method. The permutation algorithm includes of two exchange strategies which are adjacent exchange and symmetric exchange. Finally, taking ten targets as an example, the simulation results show that the proposed algorithm has better solution than that of pure permutation algorithm and this achievement can be used in the real application.

Info:

Periodical:

Edited by:

Ran Chen

Pages:

265-269

DOI:

10.4028/www.scientific.net/AMM.44-47.265

Citation:

Y. Sun et al., "Permutation Algorithm with Simulated Annealing for Laser Antimissile Problem", Applied Mechanics and Materials, Vols. 44-47, pp. 265-269, 2011

Online since:

December 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.