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

Table 3

Basic features for CVRP and graph coloring.

Problem	Min partition	Max partition	Variables	Edges
VRP	Vehicles	Vehicles	Cities	Cities connections
Graph coloring	Lower bound	Upper bound	Nodes	Edges