Browse > Article

Performance Comparison of Heuristics for Weapon-Target Assignment Problem with Transitivity Rules in Weapon's Kill Probability  

Yim, Dong-Soon (한남대학교 산업경영공학과)
Choi, Bong-Wan (한남대학교 국방전략대학원/무기체계.M&S 연구센터)
Publication Information
Journal of the military operations research society of Korea / v.36, no.3, 2010 , pp. 29-42 More about this Journal
Abstract
In this study, the weapon-target assignment problem arising in military application of operations research is considered. We reformulated the problem in order to simplify the solution methods based on genetic algorithms and heuristics. Since the problem is well known as NP-complete and cannot be solved in polynomial time, such solution methods have been widely used to obtain good solutions. Two chromosome representations--target number representation and permutation representation--in genetic algorithm are compared. In addition, a construction heuristic and three improving heuristics are developed. Several experiments under the condition of transitivity rules in weapon's kill probability have been accomplished. It shows that the construction heuristic and exchange-based improving heuristic guarantees good solutions within a second and the performance of construction heuristic is sensitive to transitivity rules.
Keywords
Weapon Assignment Problem; Heuristics; Performance;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Michaelwicz, Z., Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, 1992.
2 Murphey, R. A., "Target-based weapon target assignment problems", P. M. Pardalos, L. S. Pitsoulis, eds, Nonlinear Assignment Problems: Algorithms and Applications, KIuwer Academic Publishers, Boston, MA. 39-53, 1999
3 Ahuja, R. K., Kumar, A., Jha, K. C., and Orlin, J. B., "Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem", Operations Research, Vol. 55. No. 6, pp. 1136-1140, 2007.   DOI   ScienceOn
4 Davis, L., "Applying Adaptive Algorithms to Epistatic Domains", Proceedings of the International Joint Conference on Artificial Intelligence, 162-164, 1985.
5 Goldberg, D. E. and Lingle, R., "Alleles, Loci, and the TSP", Proceedings of the First International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, NJ, 154-159, 1985.
6 Harhalakis, G., Proth, J. M., Xie, X. L.,"Manufacturing cell design using simulated annealing: An industrial application", Journal of Intelligent Manufacturing, pp. 185-191, 1990.
7 Jones, D. R. and Bertramo, M. A., "Solving Partitioning Problems with Genetic Algorithms", Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, Los Altos, CA, 442-449, 1991
8 Lloyd, S. P. and Witsenhausen, H. S., "Weapon Allocation is NP-complete", Proc. 186 Summer Conf. Simulation, Reno, NV, 1054-1058, 1986
9 Oliver, I. M., Smith, D. J., and Holland, J. R. C., "A Study of Permutation Crossover Operators on the traveling Salesman Problem", Proceedings of the Second International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, NJ, 224-230, 1987.
10 Lee, Z. J., Fu, S. F., and Lee, C. Y., "Efficiently Solving General Weapon-Target Assignment Problem by Genetic Algorithms With Greedy Eugenics", IEEE Transactions on Systems, man, and cybernetics, Vol. 33, No. 1, pp. 113-121, 2003   DOI   ScienceOn