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

Table 2

LPH list.

Node or city	Restrictions
	1	2	3	4	5	6	7	8
	1	2	3	4	5		7	8
	1	2	3	4	5	6	7	8
	1	2	3	4	5	6	7	8

represents the node or cities.