Skip to main content
. 2020 Jul 22;20(15):4065. doi: 10.3390/s20154065
Algorithm 1 Grey wolf optimization
  • 1:

    Initialize the number of iterations for optimization Niter

  • 2:

    Initialize the positions of n grey wolves Xi, i= 1, 2, …, N

  • 3:

    Calculate the fitness value of each grey wolf

  • 4:

    Choose the best three grey wolves as Xα, Xβ, Xδ base on there fitness

  • 5:

    t0.

  • 6:

    whilet < Niter do

  • 7:

        Update the position of the wolves using to Equation (6)

  • 8:

        Update α, A, and C

  • 9:

        Calculate the fitness of each grey wolf

  • 10:

       Update the first three grey wolves Xα, Xβ, Xδ

  • 11:

       tt+1.

  • 12:

    end while

  • 13:

    returnbestfitness,Xα