Swarm Intelligence Algorithms for Weapon-Target Assignment in a Multilayer Defense Scenario: A Comparative Study

被引:21
作者
Cao, Ming [1 ]
Fang, Weiguo [1 ,2 ]
机构
[1] Beihang Univ, Sch Econ & Management, Beijing 100083, Peoples R China
[2] Beihang Univ, Key Lab Complex Syst Anal Management & Decis, Minist Educ, Beijing 100083, Peoples R China
来源
SYMMETRY-BASEL | 2020年 / 12卷 / 05期
基金
中国国家自然科学基金;
关键词
weapon-target assignment; heuristic algorithms; particle swarm optimization; ant colony optimization; sine cosine algorithm; swarm intelligence; ALLOCATION; COLONY; OPTIMIZATION; SYSTEM;
D O I
10.3390/sym12050824
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Weapon-target assignment (WTA) is a kind of NP-complete problem in military operations research. To solve the multilayer defense WTA problems when the information about enemy's attacking plan is symmetric to the defender, we propose four heuristic algorithms based on swarm intelligence with customizations and improvements, including ant colony optimization (ACO), binary particle swarm optimization (BPSO), integer particle swarm optimization (IPSO) and sine cosine algorithm (SCA). Our objective is to assess and compare the performance of different algorithms to determine the best algorithm for practical large-scale WTA problems. The effectiveness and performance of various algorithms are evaluated and compared by means of a benchmark problem with a small scale, the theoretical optimal solution of which is known. The four algorithms can obtain satisfactory solutions to the benchmark problem with high quality and high robustness, while IPSO is superior to BPSO, ACO and SCA with respect to the solution quality, algorithmic robustness and computational efficiency. Then, IPSO is applied to a large-scale WTA problem, and its effectiveness and performance are further assessed. We demonstrate that IPSO is capable of solving large-scale WTA problems with high efficiency, high quality and high robustness, thus meeting the critical requirements of real-time decision-making in modern warfare.
引用
收藏
页数:20
相关论文
共 41 条
[1]  
Ali G, 2008, ICIM 2008: PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON INDUSTRIAL MANAGEMENT, P737
[2]  
[Anonymous], 2002, APPL SOFT COMPUTING
[3]  
[Anonymous], 1999, SWARM INTELLIGENCE N
[4]  
[Anonymous], 1992, PhD thesis
[5]   Hybrid genetic-simulated annealing algorithm for optimal weapon allocation in multilayer defence scenario [J].
Bisht, S .
DEFENCE SCIENCE JOURNAL, 2004, 54 (03) :395-405
[6]   Distributed MMAS for weapon target assignment based on Spark framework [J].
Cao, Ming ;
Fang, Weiguo .
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2018, 35 (03) :3685-3696
[7]   Solving the dynamic weapon target assignment problem by an improved artificial bee colony algorithm with heuristic factor initialization [J].
Chang, Tianqing ;
Kong, Depeng ;
Hao, Na ;
Xu, Kehu ;
Yang, Guozhen .
APPLIED SOFT COMPUTING, 2018, 70 :845-863
[8]  
Ciobanu C., 2001, AN ST U OVIDIUS CONS, V9, P17
[9]   Exploration and Exploitation in Evolutionary Algorithms: A Survey [J].
Crepinsek, Matej ;
Liu, Shih-Hsi ;
Mernik, Marjan .
ACM COMPUTING SURVEYS, 2013, 45 (03)
[10]   ALLOCATING WEAPONS TO TARGET COMPLEXES BY MEANS OF NONLINEAR PROGRAMMING [J].
DAY, RH .
OPERATIONS RESEARCH, 1966, 14 (06) :992-&