Genetic Algorithm Based on Permutation Distance for Laser Antimissile Problem

Abstract:

Article Preview

The genetic algorithm based on permutation distance definition is used to solve the laser antimissile system. 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. It’s very difficult to find the global optimal solution, especially when the number of the targets is greater than six. The permutation distance definition is introduced to measure the distribution of the population. The successive zeros permutation distance is to stop the genetic algorithm iterations. Finally, taking ten targets as an example, the simulation results show that the convergence of the algorithm is fast and this achievement can be used in the real application.

Info:

Periodical:

Edited by:

Zhu Zhilin & Patrick Wang

Pages:

488-493

DOI:

10.4028/www.scientific.net/AMM.40-41.488

Citation:

Y. Sun et al., "Genetic Algorithm Based on Permutation Distance for Laser Antimissile Problem", Applied Mechanics and Materials, Vols. 40-41, pp. 488-493, 2011

Online since:

November 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.