Table 11 The efficiency of invoking the Nelder–Mead method in the final stage of HCSNM for \(FM_1 - FM_{10}\) minimax problems
From: A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems
Function | Standard CS | NM method | HCSNM |
|---|---|---|---|
\(FM _1\) | 5375.25 | 1280.35 | 705.62 |
\(FM _2\) | 6150.34 | 1286.47 | 624.24 |
\(FM _3\) | 3745.14 | 1437.24 | 906.28 |
\(FM _4\) | 11,455.17 | 19,147.15 | 3162.92 |
\(FM _5\) | 5845.14 | 1373.15 | 670.22 |
\(FM _6\) | 7895.14 | 18,245.48 | 4442.76 |
\(FM _7\) | 11,915.24 | 1936.12 | 1103.86 |
\(FM _8\) | 20,000 | 2852.15 | 2629.36 |
\(FM _9\) | 14,754.14 | 19,556.14 | 2724.78 |
\(FM _{10}\) | 6765.24 | 1815.26 | 977.56 |