A hybrid discrete grey wolf optimizer to solve weapon target assignment problems (Q1727113)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A hybrid discrete grey wolf optimizer to solve weapon target assignment problems |
scientific article; zbMATH DE number 7026591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A hybrid discrete grey wolf optimizer to solve weapon target assignment problems |
scientific article; zbMATH DE number 7026591 |
Statements
A hybrid discrete grey wolf optimizer to solve weapon target assignment problems (English)
0 references
20 February 2019
0 references
Summary: We propose a hybrid discrete grey wolf optimizer (HDGWO) in this paper to solve the weapon target assignment (WTA) problem, a kind of nonlinear integer programming problems. To make the original grey wolf optimizer (GWO), which was only developed for problems with a continuous solution space, available in the context, we first modify it by adopting a decimal integer encoding method to represent solutions (wolves) and presenting a modular position update method to update solutions in the discrete solution space. By this means, we acquire a discrete grey wolf optimizer (DGWO) and then through combining it with a local search algorithm (LSA), we obtain the HDGWO. Moreover, we also introduce specific domain knowledge into both the encoding method and the local search algorithm to compress the feasible solution space. Finally, we examine the feasibility of the HDGWO and the scalability of the HDGWO, respectively, by adopting it to solve a benchmark case and ten large-scale WTA problems. All of the running results are compared with those of a discrete particle swarm optimization (DPSO), a genetic algorithm with greedy eugenics (GAWGE), and an adaptive immune genetic algorithm (AIGA). The detailed analysis proves the feasibility of the HDGWO in solving the benchmark case and demonstrates its scalability in solving large-scale WTA problems.
0 references
0 references
0.7847071886062622
0 references
0.7704041004180908
0 references
0.7337272763252258
0 references
0.7308504581451416
0 references
0.7286192774772644
0 references