Table 4 CEC 2019 test functions.
From: Learning cooking algorithm for solving global optimization problems
Functions | Dim | Range | \(H_{min}\) |
|---|---|---|---|
\({\text {CEC19-1}}\) = Storn’s chebyshev polynomial fitting problem | 9 | [– 8192, 8192] | 1 |
\({\text {CEC19-2}}\) = Inverse Hilbert matrix problem | 16 | [– 16384, 16384] | 1 |
\({\text {CEC19-3}}\) = Lennard– jones minimum energy cluster | 18 | [– 4, 4] | 1 |
\({\text {CEC19-4}}\) = Rastrigin’s function | 10 | [– 100, 100] | 1 |
\({\text {CEC19-5}}\) = Griewangk’s function | 10 | [– 100, 100] | 1 |
\({\text {CEC19-6}}\) = Weierstrass function | 10 | [– 100, 100] | 1 |
\({\text {CEC19-7}}\) = Modified schwefel’s function | 10 | [– 100, 100] | 1 |
\({\text {CEC19-8}}\) = Expanded schaffer’s F6 function | 10 | [– 100, 100] | 1 |
\({\text {CEC19-9}}\) = Happy cat function | 10 | [– 100, 100] | 1 |
\({\text {CEC19-10}}\) = Ackley function | 10 | [– 100, 100] | 1 |
