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	30	3	1	2847	73.91	8269.19	
r_0t	x_ijt	q_it	and_so_on
1898	-1
1898	0	0	30	122	2	18	3	94	18	142	19	100	27	168	21	66	9	98	11	132	20	108	14	130	17	138	24	60	22	64	8	110	29	198	7	120	10	122	0	0	-1
1898	0	0	30	61	2	36	15	86	5	177	13	144	12	198	28	240	4	28	3	188	25	136	18	71	23	190	26	184	16	219	21	33	27	84	1	164	9	49	6	64	0	0	-1
1898	0	0	10	122	7	120	29	198	22	44	24	180	17	138	14	130	20	108	11	132	6	192	0	0	-1
1898	0	0	2	36	25	136	18	142	3	188	4	28	28	80	12	198	13	96	5	59	15	86	29	99	8	110	22	52	10	61	17	69	14	65	16	146	26	184	23	190	19	150	21	66	27	168	1	164	20	54	9	98	30	122	0	0	-1
1898	-1