From: An accelerated and robust algorithm for ant colony optimization in continuous functions
Function | ARACO |
---|---|
Storn’s Chebyshev Polynomial Fitting Problem \( \overrightarrow{x} \):[−8192, 8192]n, n = 9 | 5.23E6 |
Inverse Hilbert Matrix Problem \( \overrightarrow{x} \):[−16384, 16384]n, n = 16 | 1.3992 |
Lennard-Jones Minimum Energy Cluster \( \overrightarrow{x} \):[−4, 4]n, n = 18 | 8.3911 |
Rastrigin’s Function \( \overrightarrow{x} \):[−100, 100]n, n = 10 | 3.3252 |
Griewangk’s Function \( \overrightarrow{x} \):[−100, 100]n, n = 10 | 1.0085 |
Weierstrass Function \( \overrightarrow{x} \):[−100, 100]n, n = 10 | 2.2961 |
Modified Schwefel’s Function \( \overrightarrow{x} \):[−100, 100]n, n = 10 | 1.0001 |
Expanded Schaffer’s F6 Function \( \overrightarrow{x} \):[−100, 100]n, n = 10 | 1.2062 |
Happy Cat Function \( \overrightarrow{x} \):[−100, 100]n, n = 10 | 2.4945 |
Ackley Function \( \overrightarrow{x} \):[−100, 100]n, n = 10 | 10.8957 |