Large-scale weapon-target allocation based on an artificial bee colony algorithm

被引:0
|
作者
Zhou Y. [1 ]
Wang T. [1 ]
Chen L. [1 ]
Fu L. [1 ]
Wei Z. [2 ]
机构
[1] School of Information and Communication Engineering, Harbin Engineering University, Harbin
[2] CSSC Systems Engineering Research Institute, Beijing
关键词
adaptive; artificial bee colony; large scale; multi-objective optimization; non-dominant sorting; operator operands; weapon-target assignment;
D O I
10.11990/jheu.202206061
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Addressing the problem of large-scale weapon-target allocation, we propose an improved multi-target WTA model that generalizes weapon platforms into weapons and takes the weapon average flight time as the second optimization objective. Herein, to effectively solve such problems, an improved adaptive discrete multi-objective artificial bee colony algorithm is additionally proposed. This algorithm is based on an artificial bee colony algorithm and a non-dominated sorting strategy and introduces adaptive operator operands and a mutation probability strategy that reuses nectar source exploration information. Furthermore, its convergence is improved through the interaction between nectar sources, as well as nectar sources and external solution sets, and the population diversity is maintained through the random selection of operators. Finally, comparative experiments of weapon-target assignments of different scales proved the effectiveness of the proposed adaptive operator operand and the mutation probability strategy of reused nectar source exploration times. The proposed algorithm is compared with MOABC, MOPSO, and NSGA-II algorithms in terms of interuerted generational distance(IGD), hyper volume(HV), and time, and found to obtain Pareto solution sets with better quality on the premise of ensuring timeliness. © 2024 Editorial Board of Journal of Harbin Engineering. All rights reserved.
引用
收藏
页码:1187 / 1195
页数:8
相关论文
共 22 条
  • [1] MANNE A S., A target-assignment problem, Operations research, 6, 3, pp. 346-351, (1958)
  • [2] KWON O, KANG Donghan, LEE K, Et al., Lagrangian relaxation approach to the targeting problem, Naval research logistics, 46, 6, pp. 640-653, (1999)
  • [3] LI Peng, WU Ling, LU Faxing, A mutation-based GA for weapon-target allocation problem subject to spatial constraints, 2009 International Workshop on Intelligent Systems and Applications, pp. 1-4, (2009)
  • [4] KLINE A, AHNER D, HILL R., The weapon-target assignment problem [ J], Computers and operations research, 105, C, pp. 226-236, (2019)
  • [5] LLOYD S P, WITSENHAUSEN H S., Weapons allocation is NP-complete [ C], 1986 summer computer simulation conference, pp. 1054-1058, (1986)
  • [6] DAVIS M T, ROBBINS M J, LUNDAY B J., Approximate dynamic programming for missile defense interceptor fire control, European journal of operational research, 259, 3, pp. 873-886, (2016)
  • [7] NI Mingfang, YU Zhanke, MA Feng, Et al., A Lagrange relaxation method for solving weapon-target assignment problem [ J ], Mathematical problems in engineering, 2011, (2011)
  • [8] WU Wenhai, GUO Xiaofeng, ZHOU Siyu, Et al., Improved differential evolution algorithm for solving weapon-target assignment problem, Systems engineering and electronics, 43, 4, pp. 1012-1021, (2021)
  • [9] YAO Jishuai, GUO Hongwu, LIU Xiaoma, Et al., Improved monarch butterfly optimization for multi-to-multi weapon-target assignment problems, 2020 Chinese Automation Congress (CAC), pp. 1391-1396, (2020)
  • [10] KLINE A G, AHNER D K, LUNDAY B J., Real-time heuristic algorithms for the static weapon target assignment problem, Journal of heuristics, 25, 3, pp. 377-397, (2019)