Solving the 0/1 Knapsack Problem Using Metaheuristic and Neural Networks for the Virtual Machine Placement Process in Cloud Computing Environment

Table 7

An overview of the method comparisons for a set of 20 virtual machines.

	B&B	DP		NNA
Optimality	Provide an optimal solution	Provide an optimal solution		May not provide the optimum solution
Rate of convergence	Moderately low	Predefined		Moderately high
CPU utilization	Moderately high	Moderately high		Moderately high
Execution time	Moderately high (slower)	Moderately high		Moderately low
Efficiency	Moderately low	Moderately low		Moderately low
	PSO		Greedy
Optimality	May not provide the optimum solution		May not provide the optimum solution
Rate of convergence	Moderately high		Moderately low
CPU utilization	Moderately low		Moderately low
Execution time	Moderately low		Moderately low (faster)
Efficiency	Moderately medium		Moderately low
	GA		ACO
Optimality	May not provide the optimum solution		May not provide the optimum solution
Rate of convergence	Moderately high		Moderately low
CPU utilization	Moderately medium		Moderately medium
Execution time	Moderately low		Moderately low (faster)
Efficiency	Moderately medium		Moderately high
	TS		SA
Optimality	May not provide the optimum solution		May not provide the optimum solution
Rate of convergence	Moderately high		Moderately high
CPU utilization	Moderately medium		Moderately medium
Execution time	Moderately low		Moderately low
Efficiency	Moderately medium		Moderately medium