Skip to main content

View full-text article in PMC

. 2021 May 27;7:e574. doi: 10.7717/peerj-cs.574

Table 1. Algorithms used in the experiments and their computational complexity.

Algorithm	Complexity	Rank
SLGA	$O (o (G_{n} 5 X))$	1
ePSOGA	$O (o (G_{n} 8 X) + X l o g X)$	2
TlPSO	$O (o (G_{n} 2 X) + G_{n} 2 X)))$	3
SSPR	$O (o (X T_{n} m + G n (X + T_{n} m)))$	4
GLNSA	$O (o (G_{n} (S_{n} + X + S_{n} T_{n} m)))$	5
IJA	$O (o (G_{n} (3 X + X T_{n} m))$	6
HA	$O (o (G_{n} (4 X + X T_{n} m)))$	7
TLBO	$O (o (G_{n} (4 X + X T_{n} m)$	7
VNSGA	$O (o (G_{n} (3 X + 4 X T_{n} m)))$	8
GRASP	$O (o^{2} (G_{n} * T_{n}))$	9