Table 26 The proposed RBNRO-DE and its peers based on the computational complexity
Algorithm | Time computational complexity | Space computational complexity |
|---|---|---|
RBNRO-DE | \(O_{time}({G}_{max} \times N \times D)\) | \(O_{space}(N \times D)\) |
BSSA | \(O_{time}({G}_{max} \times N \times D)\) | \(O_{space}(N \times D)\) |
BABC | \(O_{time}({G}_{max} \times N \times D)\) | \(O_{space}(N \times D)\) |
BPSO | \(O_{time}({G}_{max} \times N \times D)\) | \(O_{space}(N \times D)\) |
BBA | \(O_{time}({G}_{max} \times N \times D)\) | \(O_{space}(N \times D)\) |
BGWO | \(O_{time}({G}_{max} \times N \times D)\) | \(O_{space}(N \times D)\) |
BWOA | \(O_{time}({G}_{max} \times N \times D)\) | \(O_{space}(N \times D)\) |
BGOA | \(O_{time}({G}_{max} \times N \times D)\) | \(O_{space}(N \times D)\) |
BSFO | \(O_{time}({G}_{max} \times N \times D)\) | \(O_{space}(N \times D)\) |
BHHO | \(O_{time}({G}_{max} \times N \times D)\) | \(O_{space}(N \times D)\) |
BBSA | \(O_{time}({G}_{max} \times N \times D)\) | \(O_{space}(N \times D)\) |
BASO | \(O_{time}({G}_{max} \times N \times D)\) | \(O_{space}(N \times D)\) |
BHGSO | \(O_{time}({G}_{max} \times N \times D)\) | \(O_{space}(N \times D)\) |