Table of Contents Author Guidelines Submit a Manuscript
International Journal of Aerospace Engineering
Volume 2017, Article ID 1746124, 14 pages
https://doi.org/10.1155/2017/1746124
Research Article

A Modified Pareto Ant Colony Optimization Approach to Solve Biobjective Weapon-Target Assignment Problem

1Aeronautics and Astronautics Engineering College, Air Force Engineering University, Xi’an, Shaanxi 710038, China
2College of Electronic Communication, Northwestern Polytechnical University, Xi’an 710072, China

Correspondence should be addressed to You Li; moc.621@020198nosaer

Received 31 December 2016; Revised 24 February 2017; Accepted 28 February 2017; Published 16 March 2017

Academic Editor: Linda L. Vahala

Copyright © 2017 You Li 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. R. N. Rai and N. Bolia, “Optimal decision support for air power potential,” IEEE Transactions on Engineering Management, vol. 61, no. 2, pp. 310–322, 2014. View at Publisher · View at Google Scholar · View at Scopus
  2. S. Matlin, “A review of the literature on the missile-allocation problem,” Operations Research, vol. 18, no. 2, pp. 334–373, 1970. View at Publisher · View at Google Scholar
  3. Z.-J. Lee, S.-F. Su, and C.-Y. Lee, “Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 33, no. 1, pp. 113–121, 2003. View at Publisher · View at Google Scholar · View at Scopus
  4. E. Çetin and S. T. Esen, “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. X.-Y. Wang, C.-Z. Hou, J.-M. Yuan, F. Guo, and W. Hao, “Modeling and optimization method on antiaircraft firepower allocation,” Control & Decision, vol. 21, no. 8, pp. 913–917, 2006. View at Google Scholar · View at Scopus
  6. B. Alidaee, H. Wang, and F. Landram, “A note on integer programming formulations of the real-time optimal scheduling and flight path selection of UAVs,” IEEE Transactions on Control Systems Technology, vol. 17, no. 4, pp. 839–843, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. A. S. Manne, “A target-assignment problem,” Operations Research, vol. 6, pp. 346–351, 1958. View at Publisher · View at Google Scholar · View at MathSciNet
  8. R. H. Day, “Allocating weapons to target complexes by means of nonlinear programming,” Operations Research, vol. 14, no. 6, pp. 992–1013, 1966. View at Publisher · View at Google Scholar
  9. P. A. Hosein and M. Athans, Preferential Defense Strategies. Part I: The Static Case, MIT Laboratory for Information and Decision Systems, Cambridge, Mass, USA, 1990.
  10. Z. R. Bogdanowicz, A. Tolano, K. Patel, and N. P. Coleman, “Optimization of weapon-target pairings based on kill probabilities,” IEEE Transactions on Cybernetics, vol. 43, no. 6, pp. 1835–1844, 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. S. Chen, J. He, and H. Liu, “Realization and simulation of parallel ant colony algorithm to solve WTA problem,” in Proceedings of the International Conference on Systems and Informatics (ICSAI '12), May 2012. View at Publisher · View at Google Scholar · View at Scopus
  12. A.-G. Fei, L.-Y. Zhang, and Q.-J. Ding, “Multi-aircraft cooperative fire assignment based on auction algorithm,” Systems Engineering & Electronics, vol. 34, no. 9, pp. 1829–1833, 2012. View at Publisher · View at Google Scholar · View at Scopus
  13. M.-Z. Lee, “Constrained weapon–target assignment: enhanced very large scale neighborhood search algorithm,” IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans, vol. 40, no. 1, pp. 198–204, 2010. View at Publisher · View at Google Scholar · View at Scopus
  14. D. G. Galati and M. A. Simaan, “Effectiveness of the Nash strategies in competitivemulti-team target assignment problems,” IEEE Transactions on Aerospace & Electronics System, vol. 43, no. 1, pp. 126–134, 2007. View at Google Scholar
  15. Z.-J. Lee and W.-L. Lee, “A Hybrid search algorithm of ant colony optimization and genetic algorithm applied to weapon-target assignment problems,” in Intelligent Data Engineering and Automated Learning, vol. 2690 of Lecture Notes in Computer Science, pp. 278–285, Springer, Berlin, Germany, 2003. View at Publisher · View at Google Scholar
  16. Y. Li and Y. Dong, “Weapon-target assignment based on simulated annealing and discrete particle swarm optimization in cooperative air combat,” Acta Aeronautica et Astronautica Sinica, vol. 31, no. 3, pp. 626–631, 2010. View at Google Scholar · View at Scopus
  17. H.-D. Chen, S.-Z. Wang, and H.-Y. Wang, “Research of firepower assignment with multi-launcher and multi-weapon based on a hybrid particle swarm optimization,” Systems Engineering & Electronics, vol. 30, no. 5, pp. 880–883, 2008. View at Google Scholar · View at Scopus
  18. X. Liu, Z. Liu, W.-S. Hou, and J.-H. Xu, “Improved MOPSO algorithm for multi-objective programming model of weapon-target assignment,” Systems Engineering & Electronics, vol. 35, no. 2, pp. 326–330, 2013. View at Publisher · View at Google Scholar · View at Scopus
  19. Y. Zhang, R.-N. Yang, J.-L. Zuo, and X.-N. Jing, “Weapon-target assignment based on decomposition-based evolutionary multi-objective optimization algorithms,” Systems Engineering & Electronics, vol. 36, no. 12, pp. 2435–2441, 2014. View at Publisher · View at Google Scholar · View at Scopus
  20. J. Li, J. Chen, B. Xin, and L. Dou, “Solving multi-objective multi-stage weapon target assignment problem via adaptive NSGAII and adaptive MOEA/D: A Comparison Study,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '15), pp. 3132–3139, May 2015. View at Publisher · View at Google Scholar · View at Scopus
  21. R. Battiti, M. Brunato, and F. Mascia, “Reactive search and intelligent optimization,” Operations Research, vol. 45, no. 1, pp. 74–89, 2008. View at Google Scholar
  22. R. Battiti and G. Tecchiolli, “The reactive tabu search,” ORSA Journal on Computing, vol. 6, no. 2, pp. 126–140, 1994. View at Publisher · View at Google Scholar
  23. M. Dorigo and L. M. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53–66, 1997. View at Publisher · View at Google Scholar · View at Scopus
  24. T. Stützle and H. H. Hoos, “Max-min ant system,” Future Generation Computer Systems, vol. 16, no. 9, pp. 889–914, 1999. View at Google Scholar
  25. S. Iredi, D. Merkle, and M. Middendorf, “Bi-criterion optimization with multi colony ant algorithms,” in Evolutionary Multi-Criterion Optimization: First International Conference, EMO 2001 Zurich, Switzerland, March 7–9, 2001 Proceedings, vol. 1993 of Lecture Notes in Computer Science, pp. 359–372, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar
  26. D. Merkle, M. Middendorf, and H. Schmeck, “Ant colony optimization for resource-constrained project scheduling,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 4, pp. 333–346, 2002. View at Publisher · View at Google Scholar · View at Scopus
  27. J. E. Bell and P. R. McMullen, “Ant colony optimization techniques for the vehicle routing problem,” Advanced Engineering Informatics, vol. 18, no. 1, pp. 41–48, 2004. View at Publisher · View at Google Scholar · View at Scopus
  28. K. Doerner, W. J. Gutjahr, R. F. Hartl, C. Strauss, and C. Stummer, “Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection,” Annals of Operations Research, vol. 131, pp. 79–99, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  29. P. Cardoso, M. Jesus, and A. Márquez, “MONACO-multi-objective network optimisation based on an ACO,” in Proceedings of the X Encuentros de Geometrıa Computacional, vol. 1, no. 1, pp. 1–10, Seville, Spain, 2013.
  30. P. R. McMullen, “An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives,” Artificial Intelligence in Engineering, vol. 15, no. 3, pp. 309–317, 2001. View at Publisher · View at Google Scholar · View at Scopus
  31. T. Stützle and M. Dorigo, “ACO algorithms for the quadratic assignment problem,” New Ideas in Optimization, vol. 3, no. 1, pp. 33–50, 2000. View at Google Scholar
  32. A. Baykasoglu, T. Dereli, and I. Sabuncu, “A multiple objective and colony ant colony optimization approach to assembly line balancing problems,” in Proceedings of the 35th International Conference on Computers and Industrial Engineering, pp. 263–268, IEEE, Istanbul, Turkey, June 2005.
  33. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002. View at Publisher · View at Google Scholar · View at Scopus
  34. E. Zitzler, M. Laumanns, and L. Thiele, “SPEA2: improving the strength pareto evolutionary algorithm,” in Proceedings of the Conference on Evolutionary Methods for Design, Optimisation and Control with Applications to Industrial Problems, pp. 95–100, Athens, Greece, September 2001.
  35. M. Dorigo and T. Tzle, “Ant colony optimization,” in Wiley Encyclopedia of Operations Research and Management Science, pp. 1155–1173, John Wiley & Sons, New York, NY, USA, 2004. View at Google Scholar
  36. I. D. I. D. Ariyasingha and T. G. I. Fernando, “Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem,” Swarm & Evolutionary Computation, vol. 23, pp. 11–26, 2015. View at Publisher · View at Google Scholar · View at Scopus
  37. B. Baran and M. Schaerer, “A multiobjective ant colony system for vehicle routing problem with time windows,” in Proceedings of the 21th IASTED International Conference on Applied Informatics, pp. 97–102, DBLP, February 2003.
  38. V. Maniezzo and A. Colorni, “The ant system applied to the quadratic assignment problem,” IEEE Transactions on Knowledge and Data Engineering, vol. 11, no. 5, pp. 769–778, 1999. View at Publisher · View at Google Scholar · View at Scopus
  39. C. García-Martínez, O. Cordón, and F. Herrera, “A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP,” European Journal of Operational Research, vol. 180, no. 1, pp. 116–148, 2007. View at Publisher · View at Google Scholar · View at Scopus
  40. Z.-J. Lee, C.-Y. Lee, and S.-F. Su, “An immunity-based ant colony optimization algorithm for solving weapon-target assignment problem,” Applied Soft Computing Journal, vol. 2, no. 1, pp. 39–47, 2002. View at Publisher · View at Google Scholar · View at Scopus
  41. Z.-J. Lee, S.-F. Su, and C.-Y. Lee, “A genetic algorithm with domain knowledge for weapon‐target assignment problems,” Journal of the Chinese Institute of Engineers, vol. 25, no. 3, pp. 287–295, 2002. View at Google Scholar · View at Scopus
  42. B. Xin, J. Chen, J. Zhang, L. Dou, and Z. Peng, “Efficient decision makings for dynamic weapon-target assignment by virtual permutation and tabu search heuristics,” IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, vol. 40, no. 6, pp. 649–662, 2010. View at Publisher · View at Google Scholar · View at Scopus
  43. B. Xin, J. Chen, Z. Peng et al., “An efficient rule-based constructive heuristic to solve dynamic weapon-target assignment problem,” IEEE Transactions on Systems Man & Cybernetics, Part A: Systems & Humans, vol. 41, no. 3, pp. 598–606, 2011. View at Google Scholar
  44. P. Chen, Y. Zheng, and W. Zhu, “Optimized simulated annealing algorithm for thinning and weighting large planar arrays in both far-field and near-field,” Frontiers of Information Technology & Electronic Engineering, vol. 11, no. 4, pp. 261–269, 2010. View at Google Scholar
  45. D. K. Ahner and C. R. Parson, “Optimal multi-stage allocation of weapons to targets using adaptive dynamic programming,” Optimization Letters, vol. 9, no. 8, pp. 1689–1701, 2015. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  46. N. Dirik, S. N. Hall, and J. T. Moore, “Maximizing strike aircraft planning efficiency for a given class of ground targets,” Optimization Letters, vol. 9, no. 8, pp. 1729–1748, 2015. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  47. H. Liang and F. Kang, “Adaptive chaos parallel clonal selection algorithm for objective optimization in WTA application,” Optik, vol. 127, no. 6, pp. 3459–3465, 2016. View at Publisher · View at Google Scholar · View at Scopus
  48. N. Li, W. Huai, and S. Wang, “The solution of target assignment problem in command and control decision-making behavior simulation,” Enterprise Information Systems, vol. 1, no. 1, pp. 1–19, 2016. View at Google Scholar