Skip to main content
. 2019 Sep 2;5:e217. doi: 10.7717/peerj-cs.217

Algorithm 1. GWO Algorithm.

1: Initialize the grey wolf population Xi (i = 1, 2, 3,…,n) and t = 1.
2: Initialize C, a, and A using Equations (7) and (8).
3: Calculate the fitness of each search agent.
4: Put the best search agent as Xα,
  the second best search agent as Xβ and
  the third best search agent as Xδ.
5: while (t < Max number of iterations)
6:  for each search agent
7:   Modify the current search position using Equation (11).
8:  end for
9:  Update a, A, and C.
10: Calculate the fitness of all search agents.
11: Modify Xα, Xβ and Xδ.
12: t = t + 1.
13: end while
14: return Xα.