A Modified Sine-Cosine Algorithm Based on Neighborhood Search and Greedy Levy Mutation

Algorithm 1

The pseudocode of the basic sine-cosine algorithm.

Set the initial parameters, including the total population size n, the maximum number of

generations N_iter, control parameter a et al.

Generate a population .

Calculate the fitness and find the best solution of the population.

for t=1: N_iter

for i=1:n

for j=1:d

Generate a rand .

if

else

end if

end for

Cross-border processing for .

Calculate the fitness

if

end if

end for

end for

Output the best solution