Input:Combat scenario parameters, including M, N, , and .
The first three best solutions in the tth iteration, , and .
The selection probability .
Output:, and
Procedures:for  ls=α, β, δ
Generate a random number between (0,1), denoted by rand;
if  randλ // execute the LSA
=;
Generate a new solution based on the perturbation operator;
Calculate the fitness value of and , denoted by and respectively;
if  
Replace with , ;
endif
Update = ;
endif
endfor
Algorithm 3: Pseudo-code of the local search algorithm.