A Hybrid Discrete Grey Wolf Optimizer to Solve Weapon Target Assignment Problems

Algorithm 1

Pseudo-code of the initialization method.

Input:Combat scenario parameters, including M, N, , , , and ,

and the population size .

Output:The initial solutions.

Procedures:for  

Set the initial value of the n_pth solution to a zero-vector .

for  i=1→M

Sort all targets in descending order according to P(i,:). Denote the index vector by IN.

Set q_max= ;

for  j=1→N

if  q_max<=0 // determine if all weapons of have been assigned

break // terminates the execution of the for loop, i.e. for  j=1→N

endif

if  E(i, IN(j))==1 // can attack

Generate a random integer, denoted by n_rand, between 1 and q_max;

Assign n_rand weapons to ;

Update q_max= q_max-n_rand;

endif

endfor

endfor

endfor