.png){kind=icon}
.png){kind=icon}
Return
Simplified swarm optimization with initialization scheme for dynamic weapon-target assignment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2019.105542.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Dynamic weapon-target assignment problem
Simplified swarm optimization
Feasible solution
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W