Inventory Routing Problem - Instances From Archetti et al. (2007)
Best Found Solution - CIRRELT, GERAD & HEC Montreal, QC Canada
inv_cost	Horizon	n	count	m	Q	tot_time	sln_val	
1	2	25	5	4	539	117.86	12962	
r_0t	x_ijt	q_it	and_so_on
1437	-1
1437	0	0	1	128	21	108	22	180	15	112	0	0	3	94.96	9	116	24	28	7	47	23	198	0	0	6	158	14	152	16	118	0	0	5	46	20	80	13	134	17	150	0	0	-1
1437	0	0	19	222	9	58	23	99	3	52.04	0	0	20	40	21	54	25	264	10	93	11	19	2	42	0	0	24	14	7	94	18	69	8	188.48	4	111	15	56	0	0	17	0	16	59	12	294	14	76	6	79	0	0	-1
1437	0	0	17	150	13	134	5	46	11	57	2	126	0	0	-1
1437	0	0	5	23	20	40	1	128	6	158	13	67	0	0	3	98	9	116	23	99	18	23	7	94	24	28	19	74	0	0	14	152	8	111.52	4	37	12	98	16	118	0	0	15	112	22	180	25	88	10	31	21	108	0	0	-1
1437	-1