Algorithm 2: HEOA based on Cauchy Mutation.
Input:  $lo{c}_i^t$
Operation
/* Human exploration step */
1.	Get the current position by Equation (24)
2.	Return $lo{c}_i^{(t+1)}$
/* Human development step */
6.	/*Leader*/: Get the current position by Equation (26)
7.	/*Explorer*/: Get the current position by Equation (27)
8.	/*Follower*/: Get the current position by Equation (28)
9.	/*Loser*/: Get the current position by Equation (29)
/* search the global optimum based on Cauchy mutation step */
10.  while $t<t_{\max }$ 11.   Implement Human exploration step, Obtain $lo{c}_i^{(t+1)}$ 12.   Implement Human development step, Obtain $lo{c}_i^{(t+1)}$ 13.   $lo{c}_{best}=Cauthy(lo{c}_i^{t+1},lo{c}_{best})$ 14.   Retrieve the fitness of best position $fi{t}_{best}$ 15.  Return $lo{c}_{best}$, $fi{t}_{best}$
/* Operation Ending */
Output: $lo{c}_{best}$, $fi{t}_{best}$