An Iterated Tabu Search Approach for the Clique Partitioning Problem

Table 1

Comparison of ITS with NS-R and NS-TS on the CPP instances considered by Brusco and Köhn.

Instance	Best known	ITS		NS-R	NS-TS
	Value 𝐹	𝐹best−𝐹 (𝐹aver−𝐹)	Succ.	𝐹−𝐹	𝐹−𝐹
rand100-5	−1407	0 (0)	10	0	0
rand100-100	−24296	0 (0)	10	0	0
rand200-5	−4079	0 (0)	10	0	0
rand200-100	−74924	0 (0)	10	0	0
rand300-5	−7732	0 (0)	10	3	3
rand300-100	−152709	0 (0)	10	0	0
sym300-50	−17592	0 (0)	10	0	0
regnier300-50	−32164	0 (0)	10	0	0
zahn300	−2504	0 (0)	10	1	0
rand400-5	−12133	0 (0.1)	9	37	13
rand400-100	−222757	0 (42.0)	7	110	208
rand500-5	−17127	0 (5.2)	7	58	41
rand500-100	−309125	118 (224.3)	0	118	735
Average		9.1 (20.9)	8.7	25.2	76.9