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	2	2	1268	138.76	8741.7	
r_0t	x_ijt	q_it	and_so_on
1690	-1
1690	0	0	12	198	28	112	9	132	27	56	14	76	26	70	5	12	6	152	3	132	24	26	23	72	19	192	17	38	0	0	11	154	13	95	29	198	30	88	8	10	15	184	16	164	4	146	22	85	1	58	7	26	0	0	-1
1690	0	0	25	237	21	25	14	152	27	31	2	45	18	63	1	116	22	170	20	207	10	222	0	0	11	77	13	190	29	99	30	44	8	20	0	0	-1
1690	0	0	17	38	19	192	23	72	24	26	3	132	6	152	5	36	21	75	28	112	12	198	0	0	-1
1690	0	0	10	74	9	132	27	58	14	152	26	70	6	76	24	13	23	36	19	96	17	19	13	190	11	154	29	198	0	0	25	79	12	99	28	56	2	30	18	21	7	26	1	116	22	170	4	146	20	69	16	164	15	184	8	20	30	88	0	0	-1
1690	-1