Table 6. Results for random problem set... | Emerald Publishing

Table 6.

Results for random problem set C (40 requirements each problem instance)

Problem instance	Days scaled	Integer program			Heuristic
Problem instance	Days scaled	Veh^o [LB]	Time^o (s)	PosD^o	Veh^h	Time^h (s)	PosD^h
C1	1	46 [18]	5,659	100	46	3	171
C1	2	29 [8]	69,089	162	29	6	235
C2	1	45 [20]	51,548	133	45	3	204
C2	2	30 [9]	61,772	201	30	6	255
C3	1	42 [28]	32,736	127	42	4	200
C3	2	25 [16]	72,489	234	27	5	269
C4	1	48 [20]	26,823	108	48	4	187
C4	2	25 [7]	70,666	174	25	3	175
C5	1	48 [46]	3,114	126	48	4	203
C5	2	28 [9]	78,613	199	28	4	254

Problem instance	Days scaled	Integer program			Heuristic
Problem instance	Days scaled	Veh^o [LB]	Time^o (s)	PosD^o	Veh^h	Time^h (s)	PosD^h
C1	1	46 [18]	5,659	100	46	3	171
C1	2	29 [8]	69,089	162	29	6	235
C2	1	45 [20]	51,548	133	45	3	204
C2	2	30 [9]	61,772	201	30	6	255
C3	1	42 [28]	32,736	127	42	4	200
C3	2	25 [16]	72,489	234	27	5	269
C4	1	48 [20]	26,823	108	48	4	187
C4	2	25 [7]	70,666	174	25	3	175
C5	1	48 [46]	3,114	126	48	4	203
C5	2	28 [9]	78,613	199	28	4	254

Notes:

LB = lower bound as of 100,000 second CPLEX limit; *Proven optimal