Ultrahigh-Dimensional Model and Optimization Algorithm for Resource Allocation in Large-Scale Intelligent D2D Communication System

Algorithm 1

Pseudo code of VGCC-PSO.

	Algorithm: VGCC-PSO
	Initialize a D-dimensional population with NP particles. Initialize p context vectors with the best p particles.
	repeat
	Randomly generate a variable , then select a variable-grouping strategy using equation (10).
	Decompose the original optimization vector into K subproblems according to the selected variable-grouping strategy.
	Denote the jth subproblem as Pj.
	for each subproblem Pjdo
	Coevolve the corresponding dimensionalities of Pj using the CC-based PSO as discussed in our previous work [22].
	end
	Update the personal best of each particle, and update the context vectors according to reference [22].
	for each context vector CVido
	Mutate CVi to CVi-mut according to the principles developed in Section 3.3.
	if f (CVi-mut) < f(CVi) then
	Update CVi using CVi-mut.
	end
	Update the global best with the best context vector.
	until the stopping criteria are satisfied