灰狼算法原理

Initialize the grey wolf population Xi (i=1,2,,,,n)
Initialize a,A,C,t=0
 
Calculate the fitness of each search agent
X(alpha) = the best search agent
X(bete) = the second best search agent
X(delta) = the third best search agent
 
while (t< Max number of iterations)
    for each search agent
        Update the position of the current search agent
    end for
 
    Update a,A,and C
    Calculate the fitness of all search agents
    Update X(alpha),X(bete),and X(delta)
    t=t+1
end while
 
return X(alpha)