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

Table 10

Time for one run of each heuristic in seconds for CVRP-capacitated instances.

A-n32-k5	7	7	12	7	7	5	7	4	7	7	9
A-n45-k6	7	7	12	7	7	5	6	3	7	7	9
A-n55-k9	7	7	11	7	7	5	5	3	7	7	9
A-n61-k9	7	7	11	7	7	5	5	3	7	7	9
A-n62-k8	7	7	11	8	7	5	6	3	7	7	9
A-n63-k9	7	7	11	7	7	5	5	3	7	7	9
A-n63-k10	7	7	11	7	7	5	5	3	7	7	9
A-n64-k9	7	7	11	7	7	5	5	3	7	7	9
A-n65-k9	7	7	11	7	7	5	5	3	7	7	9
A-n69-k9	7	7	11	8	7	5	5	3	8	7	9
CMT1	7	7	12	7	7	5	7	4	7	7	9
CMT2	7	7	11	7	7	5	5	3	8	8	9
CMT3	7	7	11	8	7	5	6	3	8	8	9
CMT4	8	8	11	8	8	6	6	3	9	9	9
CMT5	8	8	10	9	8	6	5	3	10	10	9
CMT6	7	7	12	7	7	5	6	3	7	7	9
CMT7	7	7	11	8	7	5	5	2	8	7	9
CMT8	7	7	11	8	7	5	6	3	8	8	9
CMT9	8	8	10	8	8	6	5	2	9	9	9
CMT10	8	8	10	9	8	6	5	2	10	10	9
CMT11	7	7	11	8	7	6	6	3	8	8	9
CMT12	7	7	12	7	7	5	7	3	7	7	9
CMT13	7	7	12	7	7	5	6	3	7	7	9
CMT14	7	7	12	7	7	5	7	4	7	7	9
X-n420-k130	11	11	16	11	11	9	11	8	11	11	13
X-n411-k19	11	11	16	11	11	9	11	8	11	11	13
X-n401-k29	11	11	16	11	11	9	10	7	11	11	13
GWKC1	8	8	11	9	8	6	6	3	9	9	9
GWKC2	8	8	11	10	8	6	6	3	10	10	10
GWKC3	9	9	11	11	9	7	8	4	12	12	13
GWKC4	10	10	13	12	10	8	8	3	12	12	11
GWKC5	8	8	13	9	8	6	9	4	9	8	9
GWKC6	8	8	12	9	8	6	7	3	9	9	10
GWKC7	9	9	11	9	9	7	7	3	10	10	10
GWKC8	9	9	11	11	9	7	7	3	12	12	10
GWKC9	8	8	11	9	8	6	5	3	10	10	10
GWKC10	9	9	11	10	9	7	6	3	12	11	10
GWKC11	9	9	11	11	9	7	6	3	13	13	10
GWKC12	10	10	11	12	10	8	6	3	15	15	11
GWKC13	8	8	11	10	9	7	5	2	12	12	10
GWKC14	9	9	11	10	9	7	5	3	14	14	10
GWKC15	10	10	11	11	9	7	5	3	16	16	10
GWKC16	10	10	11	12	10	8	5	3	19	18	10
GWKC17	8	8	10	9	8	6	5	2	11	11	10
GWKC18	9	9	10	10	9	7	5	2	13	13	10
GWKC19	9	9	11	11	9	7	5	3	16	15	10
GWKC20	10	10	11	12	10	8	5	3	18	18	11
X-n148-k46	11	11	16	11	11	9	11	8	11	11	13
X-n153-k22	11	11	16	11	11	9	11	7	11	11	13
X-n157-k13	11	11	16	11	11	9	10	7	11	11	13
X-n162-k11	11	11	15	11	11	9	10	7	11	11	13
X-n367-k17	11	11	15	11	11	9	10	7	11	11	13
X-n393-k38	11	11	15	11	11	9	10	7	11	11	13