Permutation Algorithm with Simulated Annealing for Laser Antimissile Problem

Yong Sun; Mao Rui Zhang; Wei Wei Liu; He Li; Li Na Zhang

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

Paper Titles

Research on Embedded Software Testing Data Generation System
p.247

The Development of Nozzle Micro-Hole Abrasive Flow Machining Equipment
p.251

Mechanism of Parameters Variation about Electronic Components Subjected to High Impact Loads
p.256

Research on the Influencing Factors of Dynamic Characteristics of Electronic Injector
p.260

Permutation Algorithm with Simulated Annealing for Laser Antimissile Problem
p.265

Hybrid Mean Particle Swarm Optimization Algorithm for Permutation Flow Shop Scheduling Problem
p.270

Research on Dynamic Characteristic Testing Method for Large-Scale Rolling Mill Servo Cylinder
p.275

Research on NC Technology for High Speed Milling
p.280

The Shell Molding Process Study for Mass Production of Single-Cylinder Diesel Engine Crankshaft
p.284

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 44-47Permutation Algorithm with Simulated Annealing for...

Permutation Algorithm with Simulated Annealing for Laser Antimissile Problem

Abstract:

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.

You might also be interested in these eBooks

Frontiers of Manufacturing and Design Science

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 44-47)

Pages:

265-269

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.44-47.265

Citation:

Cite this paper

Online since:

December 2010

Authors:

Yong Sun, Mao Rui Zhang, Wei Wei Liu, He Li, Li Na Zhang

Keywords:

Adjacent Exchange, Laser Antimissile, Pursuit Navigation, Simulated Annealing (SA), Symmetric Exchange

Export:

RIS, BibTeX

Price:

Permissions:

Request Permissions

References

[1] L. N. Xing, Y. W. Chen and K. W. Yang: A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem, Engineering Applications of Artificial Intelligence; Vol. 21(2008).

DOI: 10.1016/j.engappai.2008.01.003

Google Scholar

[2] C. Reeves: Modern heuristic techniques for combinatorial problems. Oxford: Blackwell, (1993).

Google Scholar

[3] S. Kirkpatrick: Optimisation by simulated annealing, Science 220 (4598), (1983), pp.671-680.

Google Scholar

[4] P. Tian, J. Ma, D. M. Zhang: Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: an investigation of generation mechanism. European Journal of Operational Research, Vol. 118(1999).

DOI: 10.1016/s0377-2217(98)00308-7

Google Scholar

[5] L. Ingber: Very fast simulated re-annealing. Mathematical Computer Modelling12 (8), (1989), pp.967-973.

DOI: 10.1016/0895-7177(89)90202-1

Google Scholar

[6] M. Zhang: A permutation algorithm for laser antimissile strategy optimization. Proceedings of the International Conference on Optimization and Control, Guiyang, China, (2010), pp.405-418.

Google Scholar