Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2011, Article ID 873292, 10 pages
Research Article

A Lagrange Relaxation Method for Solving Weapon-Target Assignment Problem

Institute of Communication Engineering, PLA University of Science and Technology, NanJing 210007, China

Received 18 August 2011; Accepted 9 October 2011

Academic Editor: Xing-Gang Yan

Copyright © 2011 Mingfang Ni et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. R. Jay and Y. Adnan, “The generalized weapon target assignment problem,” in Proceedings of the 10th international Command and Control Research and Technology Symposium, 2005.
  2. K. A. Ravindra, K. Arvind, C. J. Krishna, and B. O. James, “Exact and heuristic algorithms for the weapon-target assignment problem,” Operations Research, vol. 55, no. 6, pp. 1136–1146, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  3. Y. W. Chen, H. P. Cai, and L. N. Xing, “Improved algorithm of policies optimization of dynamic weapon target assignment problem,” Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, vol. 27, no. 7, pp. 160–165, 2007. View at Google Scholar · View at Scopus
  4. C. Eyup and T. E. Seda, “A weapon-target assignment approach to media allocation,” Applied Mathematics and Computation, vol. 175, no. 2, pp. 1266–1275, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. S. Silven, “A neural approach to the assignment algorithm for multiple-target tracking,” IEEE Journal of Oceanic Engineering, vol. 17, no. 4, pp. 326–332, 1992. View at Publisher · View at Google Scholar · View at Scopus
  6. Z. J. Lee, S. F. Su, and C. Y. Lee, “Efficiently solving general weapon-target assignment problem by genetic algorithms with greed eugenics,” IEEE Journal on Systems, Man, And Cybernetics Part B, vol. 33, no. 1, pp. 119–120, 2003. View at Google Scholar
  7. F. X. Liu and Q. H. Xing, “Optimized target assign method based on mixed genetic algorithms,” System Engineering Theory and Practice, vol. 22, no. 7, pp. 15–18, 2002. View at Google Scholar
  8. W. Wang, S. C. Cheng, and Y. Z. Zhang, “Research on approach for a type of weapon target assignment problem solving by genetic algorithm,” Systems Engineering and Electronics, vol. 30, no. 9, pp. 1708–1711, 2008. View at Google Scholar · View at Scopus
  9. J. X. Yu, S. H. Wang, and W. X. Cheng, “Target allocation decision making based on improved genetic algorithms with local search,” Systems Engineering and Electronics, vol. 30, no. 6, pp. 1114–1118, 2008. View at Google Scholar
  10. E. B. Dale, G. Michel, G. Francois, J. Y. Potvin, and S. Rene, “A tabu search heuristic for resource management in naval warfare,” Journal of Heuristics, vol. 9, no. 2, pp. 145–169, 2004. View at Google Scholar
  11. S. Han, Y. A. Liu, X. G. Yang, and J. Liu, “WTA problem in the warship fleet,” Fire Control and Command Control, vol. 34, no. 2, pp. 32–35, 2009. View at Google Scholar
  12. R. S. James and H. Henry, “An expert system for a resource allocation problem,” Communications of the ACM, vol. 28, no. 9, pp. 994–1004, 1985. View at Google Scholar
  13. L. A. Wolsey, Integer Programming, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, NY, USA, 1998.