A Methodology to Determine the Subset of Heuristics for Hyperheuristics through Metalearning for Solving Graph Coloring and Capacitated Vehicle Routing Problems

Table 12

Summary cluster/classes with means algorithm.

Cluster	# of instances	%	GC	CVRP	Min nodes	Max nodes	Min colors/vehicles	Max colors/vehicles
1	18	12.9	18	0	11	149	3	6
2	10	7.2	8	2	420	3600	3	214
3	11	7.9	0	11	148	480	5	46
4	5	3.6	0	5	367	420	17	130
5	19	13.7	19	0	64	256	7	30
6	31	22.3	31	0	125	900	11	122
7	11	7.9	11	0	352	701	3	14
8	34	24.5	0	34	32	483	5	33