By Topic

Solving Weapon-Target Assignment Problem using Discrete Particle Swarm Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)
Xiangping Zeng ; Shenyang Inst. of Autom., Chinese Acad. of Sci., Shenyang ; Yunlong Zhu ; Lin Nan ; KunYuan Hu
more authors

This paper presents a discrete particle swarm optimization (DPSO) to solve weapon-target assignment (WTA) problem. The proposed algorithm sponges the advantages of PSO and GA. Originally the greedy searching strategy is introduced into DPSO in which a priority set is constructed to control the local search and converge to the global optimum efficiently. Then the particles would be updated based on the information of priority set. Furthermore, the concept of "permutation" is employed to the update strategy. Finally, particles will be reinitialized as long as they are stagnated in the search space. The experimental results illustrate that the DPSO is a promising optimization method, which is especially useful for optimization problem with discrete variables

Published in:

Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on  (Volume:1 )

Date of Conference:

0-0 0