Table 12 Optimal solution produced by each algorithm for the speed reducer design problem.

From: A multistrategy improved hunger games search algorithm

Algorithm

\(\:\varvec{b}\)

\(\:\varvec{m}\)

\(\:\varvec{z}\)

\(\:{\varvec{l}}_{1}\)

\(\:{\varvec{l}}_{2}\)

\(\:{\varvec{d}}_{1}\)

\(\:{\varvec{d}}_{2}\)

MHGS

3.500000

0.700000

17.000000

7.300000

7.715320

3.350215

5.286654

HGS

3.500000

0.700000

17.000000

7.300000

7.715320

3.350215

5.286654

CDO

3.600000

0.700000

17.000000

8.300000

8.300000

3.378802

5.290333

SCSO

3.500206

0.700000

17.000000

7.308098

7.739710

3.351613

5.286939

AOA

3.600000

0.700000

17.000000

7.300000

8.034523

3.470205

5.321308

AGWO

3.600000

0.700000

17.000000

7.300000

8.300000

3.360438

5.295064

WOA

3.515989

0.700000

17.000000

7.578152

8.108536

3.363331

5.286791

GWO

3.501402

0.700000

17.000000

7.334880

7.791578

3.353653

5.287155

PSO

3.509908

0.700000

17.000000

7.372485

8.300000

3.355851

5.293236