Research of genetic-ant colony fusion algorithm for multi-missile cooperative combat target assignment problem

Authors:
Zhang Qiang;Lei Humin;Wang Fei;Dong Feiyao
Affiliations:
Missile Institute, Air Force Engineering University, Sanyuan;Missile Institute, Air Force Engineering University, Sanyuan;Missile Institute, Air Force Engineering University, Sanyuan;Missile Institute, Air Force Engineering University, Sanyuan
Venue:
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Year:
2009

Citing 4
Cited 0

Crossover on intensive search and traveling salesman problem

ICC&IE-94 Selected papers from the 16th annual conference on Computers and industrial engineering
MAX-MIN Ant system

Future Generation Computer Systems
A parallel implementation of ant colony optimization

Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-missile cooperative combat target assignment problem is a typical NP-C problem. Some algorithms for solving this problem are discussed first. Then based on the genetic algorithm with direction evolution and Max-Min ant system, a genetic-ant colony fusion algorithm is put forward. Algorithm experimental result is given in the end, which shows that this new target assignment method is valid with better performance and faster convergence rate.