Table 2.
The connection time of each array element obtained using different algorithms.
Algorithms | Optimal on − time (τnn) | |||||||
---|---|---|---|---|---|---|---|---|
DE | 1.000 | 1.000 | 1.000 | 1.000 | 1.000 | 0.998 | 1.000 | 0.949 |
0.901 | 0.926 | 0.823 | 0.020 | 0.013 | 0.988 | 0.095 | 0.403 | |
TLBO | 1.000 | 1.000 | 1.000 | 0.944 | 0.936 | 0.824 | 0.809 | 0.751 |
0.667 | 0.454 | 0.606 | 0.321 | 0.288 | 0.314 | 0.282 | 0.247 | |
QPSO | 1.000 | 0.999 | 0.999 | 0.995 | 0.985 | 0.980 | 0.668 | 0.947 |
0.216 | 0.861 | 0.872 | 0.926 | 0.256 | 0.068 | 0.275 | 0.070 | |
DO | 0.419 | 1.000 | 1.000 | 1.000 | 0.983 | 0.916 | 1.000 | 0.858 |
1.000 | 0.292 | 0.528 | 0.569 | 0.199 | 0.282 | 0.422 | 0.434 | |
CENDO | 0.319 | 0.998 | 1.000 | 1.000 | 0.931 | 0.904 | 0.671 | 0.625 |
0.614 | 0.650 | 0.587 | 0.558 | 0.444 | 0.484 | 0.272 | 0.295 |
Significant values are in [bold].