Input: C l u s t e r s , m , I m p r o v e m e n t , M a x i t e r a t i o n s

Output: μ b e s t

1.

μ 0 M e t a h e u r i s t i c ( C l u s t e r s , m )

2.

while ( ¬ S t o p C o n d i t i o n )

3.

c j = i = 1 N μ i j m x i / i = 1 N μ i j m

4.

if ( | C o s t ( Z t ) C o s t ( Z t 1 ) | < I m p r o v e m e n t M a x i t e r a t i o n s )

5.

Stop

6.

Else

7.

μ i j = 1 / k = 1 C ( x i c j x i c k ) 2 / m 1

8.

end

9.

μ b e s t μ i j

10.

end

11.

Return ( μ b e s t )