Algorithm 2. Population Initialization.

Input: population size $\mathit{N}\mathit{P}$ , fitness function $\mathit{f}(\mathit{x})$

Output: initial population $\mathit{P}\mathbf{=}\mathbf{\{}{\mathit{x}}^{\mathbf{1}}\mathbf{,}{\mathit{x}}^{\mathbf{2}}\mathbf{,}\mathbf{\dots }{\mathit{x}}^{\mathit{M}}\mathbf{\}}$

1: For int$\mathit{i}\mathbf{=}\mathbf{1}$to$\mathit{N}\mathit{P}$;

2: For int $\mathit{j}\mathbf{=}\mathbf{1}$ to $\mathit{n}$

3: Generate a uniformly distributed random $\mathit{u}$ in [0, 1];

4: If $\mathit{u}\mathbf{\le }\mathit{p}$

5: ${\mathit{x}}^{\mathit{i}}(\mathit{j})\mathbf{=}\mathbf{1}\mathbf{;}$

6: Else ${\mathit{x}}^{\mathit{i}}(\mathit{j})\mathbf{=}\mathbf{0}\mathbf{;}$

7: End for

8: Calculate ${\mathit{x}}^{\mathit{i}\mathbf{\prime }}$ through Formula (9);

9: End for

10: Compute fitness of all vectors in alternative population;

11: Select the former$\mathit{N}\mathit{P}$ vectors as initial population;

12: Compute the optional solution ${\mathit{x}}^{\mathbf{\ast }}$ and its fitness $\mathit{B}\mathbf{=}\mathit{f}({\mathit{x}}^{\mathbf{\ast }})$ in initial population