Improved Binary Grasshopper Optimization Algorithm for Feature Selection Problem

. 2022 May 31;24(6):777. doi: 10.3390/e24060777

Algorithm 1: Pseudocode of GOA

1:
Initialize $C_{m a x}$ , $C_{m i n}$ (two extreme values of parameter c), $M a x_i t e r$ (iterations’ maximum) and N (population of grasshoppers)
2:
Initialize the position of each grasshopper: $X_{i}$ (i = 1,2, …, n)
3:
Set the best solution as Target
4:
whilet ≤ $M a x i t e r$ do
5:
Update c with Equation (6)
6:
for each agent do
7:
Normalize the distance among two individuals to [1, 4]
8:
Update $X_{i}$ using Equation (5)
9:
Update Target, if a better value is obtained
10:
end for
11:
$t = t + 1$
12:
end while
13:
Output Target