Table 5 The efficiency of invoking the Nelder–Mead method in the final stage of SSSO algorithm for \(FI_1 - FI_{7}\) integer programming problems
From: A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems
Function | Standard CS | NM method | HCSNM |
|---|---|---|---|
\(FI _1\) | 11,880.15 | 1988.35 | 638.3 |
\(FI _2\) | 7176.23 | 678.15 | 232.64 |
\(FI _3\) | 6400.25 | 819.45 | 1668.1 |
\(FI _4\) | 4920.35 | 266.14 | 174.04 |
\(FI _5\) | 7540.38 | 872.46 | 884.48 |
\(FI _6\) | 4875.35 | 254.15 | 155.89 |
\(FI _7\) | 3660.45 | 245.47 | 210.3 |