Table 2.

Pseudo-code of the evolution strategy algorithm.

1. Set k = 0

2. Initialize Pk = (x1, …, xn) with $x_j={(C_{{\mathrm{HbO}}_2},C_{\mathrm{Hb}},A,b)}_j$

3. Evaluate Pk

4. Repeat while (not converged)

a. Recombine ${\tilde{P}}_k=\left({\tilde{x}}_1,...,{\tilde{x}}_m\right)$ (m > n)

b. Mutate $P_k={\tilde{P}}_k+Z_k$

c. Evaluate Pk

d. Select n best individuals

e. k = k + 1

5. End