Skip to main content
. 2025 May 12;10(5):314. doi: 10.3390/biomimetics10050314
Algorithm 3 Binary Grey Wolf Optimizer.

 Input: The population X={X1,X2,…,Xi}

 Output: The updated population X′={X1′,X2′,…,Xi′} and Xα

  •  1:

    Initialize binary random population X

  •  2:

    Evaluate the objective function of each individual

  •  3:

    Identify the Xα, Xβ, and Xδ in the population

  •  4:

    for iteration (t) do

  •  5:

          for solution(i) do

  •  6:

                Update a, A, and C using Equation (8)

  •  7:

                Update X1, X2, and X3 using Equation (6)

  •  8:

                Update the position of Xit using Equation (5)

  •  9:

          end for

  • 10:

        Binarization of population X using Algorithm 1

  • 11:

        Evaluate the objective function of each individual

  • 12:

        Update Xα, Xβ, and Xδ

  • 13:

    end for

  • 14:

    Return (Xα)