A Hybrid Harmony Search Algorithm with Distribution Estimation for Solving the 0-1 Knapsack Problem

Algorithm 1

Harmony search algorithm.

	for i = 1 to N do
	If rand < HMCR
	% Determine whether to perform a harmony memory consideration operation
	If rand < PAR then
	% Determine whether to perform genetic manipulation
	end if
	else
	%Conduct random mutation operation
	end if
	end for