HA-CCP: A Hybrid Algorithm for Solving Capacitated Clustering Problem

Algorithm 1

IG-GRASP.

	Input: graph ;
	Output: best solution ;
(1)	EmptySolution();
(2)	;/ is the maximum time allowed, and is the number of nodes in graph /
(3)	;/ is the maximum of iteration without improving allowed/
(4)	;/ is the best solution generated∗/
(5)	whiledo
(6)	CM ;/CM is the construction method/
(7)	IM 2 − 1 ;/IM2-1 is the local search method/
(8)	whiledo
(9)	DM2 ;/ Partially destruct the solution /
(10)	CM ;/ Reconstruct solution /
(11)	IM2-1 ;/ Local search /
(12)	ifthen
(13)	;
(14)	;
(15)	else
(16)	;
(17)	end if;
(18)	end while;
(19)	end while;
(20)	return x^b;