Skip to main content

Table 9 Comparison of results of ARACO and other metaheuristics in tests with the CEC 2019 100-Digit Challenge benckmark functions

From: An accelerated and robust algorithm for ant colony optimization in continuous functions

Function

ARACO

FDO

DA

WOA

SSA

Storn’s Chebyshev Polynomial Fitting Problem \( \overrightarrow{x} \):[−8192, 8192]n, n = 9

5.60E9

4585.27

5.43E10

4.11E10

6.05E9

Inverse Hilbert Matrix Problem \( \overrightarrow{x} \):[−16384, 16384]n, n = 16

1.9243

4

78.0368

17.3495

18.3434

Lennard-Jones Minimum Energy Cluster \( \overrightarrow{x} \):[−4, 4]n, n = 18

12.6736

13.7024

13.7026

13.7024

13.7025

Rastrigin’s Function \( \overrightarrow{x} \):[−100, 100]n, n = 10

5.6495

34.0837

344.3561

394.6754

41.6936

Griewangk’s Function \( \overrightarrow{x} \):[−100, 100]n, n = 10

1.0635

2.1392

2.5572

2.7342

2.2084

Weierstrass Function \( \overrightarrow{x} \):[−100, 100]n, n = 10

10.5288

12.1332

9.8955

10.7085

6.0798

Modified Schwefel’s Function \( \overrightarrow{x} \):[−100, 100]n, n = 10

1.0005

120.4858

578.9531

490.6843

410.3964

Expanded Schaffer’s F6 Function \( \overrightarrow{x} \):[−100, 100]n, n = 10

1.8266

6.1021

6.8734

6.909

6.37

Happy Cat Function \( \overrightarrow{x} \):[−100, 100]n, n = 10

3.0513

2

6.0467

5.9371

3.6723

Ackley Function \( \overrightarrow{x} \):[−100, 100]n, n = 10

12.9822

2.7182

21.2604

21.2761

21.04