An Improved Squirrel Search Algorithm for Optimization

Algorithm 2

Pseudocode of basic ISSA.

Set , , n, , , , and

Randomly initialize the flying squirrels locations

Calculate fitness value

while  

Generate new locations

for  t = 1: n1 (n1 = total number of squirrels on acorn trees)

if  

else

end

end

for  t = 1: n2 (n2 = total number of squirrels on normal trees moving towards acorn trees)

if  

else

end

end

for  t = 1: n3 (n3 = total number of squirrels on normal trees moving towards hickory trees)

if  

else

end

end

if  

end

Calculate fitness value of new locations

if  

end

Enhance intensive dimensional search

Find  

for  j = 1:n

Calculate fitness value of the new solution

if  

end

end

end