Resource Allocation Schemes Based on Intelligent Optimization Algorithms for D2D Communications Underlaying Cellular Networks

Table 2

The complexities of the algorithms.

	The times of running fitness function	The times of running random function
GA	MAXI ∗ (K/2 ∗ Pc ∗ 2 + K ∗ M ∗ Pm)	MAXI ∗ (K/2 + K ∗ M)
EA	N^M	0
IHSA	MAXI ∗ (K ∗ HMCR ∗ PAR + K ∗ (1 − HMCR))	MAXI ∗ (M ∗ K + M ∗ K ∗ HMCR + M ∗ K ∗ HMCR ∗ PAR + M ∗ K ∗ (1 − HMCR))
RA	1	M