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

Table 4

Characteristics for instances.

Instance	Lower bound	Upper bound	Nodes	Edges
1	3	3	8	50	3	2	1	4
2	5	10	6	36	4	3	1.5	1.5
3	3	8	25	80	3	1	2	4
4	10	10	50	80	2	4	3	1