A Modified Pareto Ant Colony Optimization Approach to Solve Biobjective Weapon-Target Assignment Problem
Authors:
Open Access
- 16 March 2017
- journal article
- research article
- Published by Wiley in International Journal of Aerospace Engineering
- Vol. 2017, 1-14
Abstract
The weapon-target assignment (WTA) problem, known as an NP-complete problem, aims at seeking a proper assignment of weapons to targets. The biobjective WTA (BOWTA) optimization model which maximizes the expected damage of the enemy and minimizes the cost of missiles is designed in this paper. A modified Pareto ant colony optimization (MPACO) algorithm is used to solve the BOWTA problem. In order to avoid defects in traditional optimization algorithms and obtain a set of Pareto solutions efficiently, MPACO algorithm based on new designed operators is proposed, including a dynamic heuristic information calculation approach, an improved movement probability rule, a dynamic evaporation rate strategy, a global updating rule of pheromone, and a boundary symmetric mutation strategy. In order to simulate real air combat, the pilot operation factor is introduced into the BOWTA model. Finally, we apply the MPACO algorithm and other algorithms to the model and compare the data. Simulation results show that the proposed algorithm is successfully applied in the field of WTA which improves the performance of the traditional P-ACO algorithm effectively and produces better solutions than the two well-known multiobjective optimization algorithms NSGA-II and SPEA-II.Keywords
This publication has 31 references indexed in Scilit:
- A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSPEuropean Journal of Operational Research, 2007
- Ant colony optimization techniques for the vehicle routing problemAdvanced Engineering Informatics, 2004
- Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenicsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2003
- Ant colony optimization for resource-constrained project schedulingIEEE Transactions on Evolutionary Computation, 2002
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- An immunity-based ant colony optimization algorithm for solving weapon–target assignment problemApplied Soft Computing, 2002
- A genetic algorithm with domain knowledge for weapon‐target assignment problemsJournal of the Chinese Institute of Engineers, 2002
- An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectivesArtificial Intelligence in Engineering, 2001
- The ant system applied to the quadratic assignment problemIEEE Transactions on Knowledge and Data Engineering, 1999
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997