Skip to main content

Table 7 HCSNM and other meta-heuristics algorithms for \(FI_1 - FI_{7}\) integer programming problems

From: A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems

Function

GA

PSO

FF

GWO

HCSNM

\(FI _1\)

 Avg

1640.23

20,000

1617.13

860.45

613.48

 SD

425.18

0.00

114.77

43.66

21.18

\(FI _2\)

 Avg

1140.15

17,540.17

834.15

880.25

799.23

 SD

345.25

1054.56

146.85

61.58

41.48

\(FI _3\)

 Avg

4120.25

20,000

1225.17

4940.56

764.15

 SD

650.21

0.00

128.39

246.89

37.96

\(FI _4\)

 Avg

1020.35

16,240.36

476.16

2840.45

205.48

 SD

452.56

1484.96

31.29

152.35

39.61

\(FI _5\)

 Avg

1140.75

13,120.45

1315.53

1620.65

792.56

 SD

245.78

1711.83

113.01

111.66

53.32

\(FI _6\)

 Avg

1040.45

1340.14

345.71

3660.25

294.53

 SD

115.48

265.21

35.52

431.25

33.90

\(FI _7\)

 Avg

1060.75

1220.46

675.48

1120.15

222.35

 SD

154.89

177.19

36.36

167.54

33.55

  1. Italic values indicate the best values