Table 4.
The average cost time of each algorithm for the CEC05 problem, Dimension = 30, Maximum Iterations = 500.
| ESOA | PSO [16] | GA [5] | DE [6] | GWO [18] | HHO [83] | |
|---|---|---|---|---|---|---|
| F1 | 0.743205 | 0.813564 | 0.932624 | 0.69359 | 0.710619 | 0.820192 |
| F2 | 1.3374 | 1.0858 | 1.268 | 0.938598 | 0.9772 | 1.1564 |
| F3 | 4.4884 | 4.35339 | 4.5192 | 4.2196 | 4.2218 | 6.98319 |
| F4 | 0.577956 | 0.682438 | 0.95496 | 0.630826 | 0.580365 | 0.809334 |
| F5 | 1.08654 | 0.848078 | 1.10613 | 0.822341 | 0.743037 | 1.07561 |
| F6 | 0.761223 | 0.75511 | 1.01592 | 0.718751 | 0.646592 | 0.899095 |
| F7 | 1.81767 | 1.05312 | 1.3103 | 1.03578 | 0.953007 | 1.32848 |