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

Table 4.

Results for random problem set A (10 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
A1	1	14 [*]	60	31	15	2	48
A1	2	14 [11]	135	27	14	2	70
A1	3	12 [8]	5,656	32	12	3	77
A2	1	15 [10]	1,490	33	15	1	58
A2	2	11 [7]	17,372	46	11	2	70
A2	3	9 [6]	19,869	49	9	3	60
A3	1	15 [14]	338	49	15	2	67
A3	2	12 [9]	2,533	45	12	2	74
A3	3	11 [9]	10,683	47	11	3	74
A4	1	16 [15]	550	17	16	1	43
A4	2	11 [9]	41,283	36	11	3	57
A4	3	10 [5]	24,179	38	10	3	62
A5	1	13 [*]	383	39	13	3	66
A5	2	11 [7]	17,440	49	11	5	85
A5	3	11 [4]	13,533	54	11	5	88

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
A1	1	14 [*]	60	31	15	2	48
A1	2	14 [11]	135	27	14	2	70
A1	3	12 [8]	5,656	32	12	3	77
A2	1	15 [10]	1,490	33	15	1	58
A2	2	11 [7]	17,372	46	11	2	70
A2	3	9 [6]	19,869	49	9	3	60
A3	1	15 [14]	338	49	15	2	67
A3	2	12 [9]	2,533	45	12	2	74
A3	3	11 [9]	10,683	47	11	3	74
A4	1	16 [15]	550	17	16	1	43
A4	2	11 [9]	41,283	36	11	3	57
A4	3	10 [5]	24,179	38	10	3	62
A5	1	13 [*]	383	39	13	3	66
A5	2	11 [7]	17,440	49	11	5	85
A5	3	11 [4]	13,533	54	11	5	88

Notes:

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