Algorithm 1. Mutates Dimensionally

1: Generate d random numbers of T-distribution with 25 degrees of freedom parameter. 2: for i = 1: d $3: \mathrm{The} \mathrm{new} \mathrm{solution} \mathrm{is} \mathrm{obtained} \mathrm{after} \mathrm{calculating} \mathrm{the} \mathrm{variation} \mathrm{according} \mathrm{to} \mathrm{Equation} \left(17\right) X_{new}^d$ 4:       boundary condition procedure 5:       if fnew < fbest $6:\hspace{1em}\hspace{1em}\hspace{1em} \mathrm{Replace} \mathrm{the} \mathrm{original} X_{best }^d$$\mathrm{with} \mathrm{the} \mathrm{new} \mathrm{position} X_{new}^d$ $7:\hspace{1em}\hspace{1em}\hspace{1em} \mathrm{Calculate} \mathrm{the} \mathrm{fitness} \mathrm{value} \mathrm{based} \mathrm{on} \mathrm{the} \mathrm{new} \mathrm{position}{X}_{best}$ 8:   end if 9: end for 10: Return the best fitness value and the best individual