| Input:Combat scenario parameters, including M, N, , , , . |
| Necessary parameters of HDGWO, including the population size , the maximum iteration number , the |
| elitist retention proportion , the penalty factor vector , the perturbation value and the selection |
| probability . |
| Output:The optimal or suboptimal assignment scheme. |
| Procedures:Step 1.Set t =0; |
| Step 2.Initialize the solutions in the first iteration; |
| Step 3.Calculate the fitness value of all solutions in the tth iteration by formula (13), and sort solutions in |
| descending order according to their fitness value, denoted by , , …, . |
| Step 4.Define three solution sets, |
| , |
| , and |
| . |
| Step 5.Update to by the modular position update method; |
| Step 6.Perform the local search on , and obtain ; |
| Step 7.Select the first best solutions set as the current solutions from |
| ; |
| Step 8.Update t =t+1. If , return to Step 3; otherwise, continue. |
| Step 9.Return the solution with the best fitness value in . |
