Simplified swarm optimization with initialization scheme for dynamic weapon-target assignment problem

被引:25
作者
Lai, Chyh-Ming [1 ]
Wu, Tsung-Hua [1 ]
机构
[1] Natl Def Univ, Management Coll, Inst Resources Management & Decis Sci, Taipei 112, Taiwan
关键词
Dynamic weapon-target assignment problem; Simplified swarm optimization; Feasible solution; SIMULATED ANNEALING ALGORITHM; DECISION-MAKINGS; TASK ASSIGNMENT; ALLOCATION; EVOLUTIONARY;
D O I
10.1016/j.asoc.2019.105542
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The dynamic weapon-target assignment (DWTA) problem is a critical issue in the field of military operations research. The problem is highly constrained; thus, the use of an evolutionary method to solve the DWTA problem often encounters a population of infeasible solutions resulting in prohibitive computational burden. Aiming at accelerating the solution process and improving the solution quality, this work proposes an improved simplified swarm optimization called SSODT with two novel schemes: the deterministic initialization scheme, and the target exchange scheme. The deterministic initialization scheme is used in population initialization and utilizes problem-specific knowledge of DWTA to speed up the convergence of SSODT by generating a promising feasible solution which has a greater potential for evolving globally. The target exchange scheme is a local search updating feasible solutions in a manner that exchanges their variables without violating the engagement feasibility to enhance the exploitation capability of SSODT. The proposed method is empirically verified on thirty-six artificial problems and compared with widely popular evolutionary methods. The results demonstrate that the proposed SSODT is better than its competitors in terms of both solution quality and efficiency. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页数:15
相关论文
共 64 条
[1]   Exact and heuristic algorithms for the weapon-target assignment problem [J].
Ahuja, Ravindra K. ;
Kumar, Arvind ;
Jha, Krishna C. ;
Orlin, James B. .
OPERATIONS RESEARCH, 2007, 55 (06) :1136-1146
[2]  
[Anonymous], 2013, RECENT ADV META HEUR
[3]   Robust, fast and optimal solution of practical economic dispatch by a new enhanced gradient-based simplified swarm optimisation algorithm [J].
Azizipanah-Abarghooee, Rasoul ;
Niknam, Taher ;
Gharibzadeh, Masihallah ;
Golestaneh, Faranak .
IET GENERATION TRANSMISSION & DISTRIBUTION, 2013, 7 (06) :620-635
[4]   A new hybrid bacterial foraging and simplified swarm optimization algorithm for practical optimal dynamic load dispatch [J].
Azizipanah-Abarghooee, Rasoul .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2013, 49 :414-429
[5]   A modification of tree-seed algorithm using Deb's rules for constrained optimization [J].
Babalik, Ahmet ;
Cinar, Ahmet Cevahir ;
Kiran, Mustafa Servet .
APPLIED SOFT COMPUTING, 2018, 63 :289-305
[6]  
Benavoli A, 2016, J MACH LEARN RES, V17
[7]   Hybrid genetic-simulated annealing algorithm for optimal weapon allocation in multilayer defence scenario [J].
Bisht, S .
DEFENCE SCIENCE JOURNAL, 2004, 54 (03) :395-405
[8]  
Cai Huaiping, 2006, Journal of Systems Engineering and Electronics, V17, P559, DOI 10.1016/S1004-4132(06)60097-2
[9]  
Chang S.C., 1987, DEC CONTR 1987 26 IE, V26, P1678
[10]   Evolutionary decision-makings for the dynamic weapon-target assignment problem [J].
Chen Jie ;
Xin Bin ;
Peng ZhiHong ;
Dou LiHua ;
Zhang Juan .
SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2009, 52 (11) :2006-2018