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	
2	2	30	2	3	845	166	21958	
r_0t	x_ijt	q_it	and_so_on
1690	-1
1690	0	0	30	88	8	10	15	184	16	164	22	85	1	58	18	21	2	30	27	58	9	132	0	0	25	158	23	72	19	192	17	38	13	95	11	92	29	198	0	0	12	198	28	112	21	25	14	152	26	70	5	12	6	152	3	98	24	26	0	0	-1
1690	0	0	10	148	7	26	1	116	22	85	4	73	20	207	0	0	8	20	30	44	29	99	13	190	11	139	0	0	-1
1690	0	0	28	112	14	152	27	58	2	30	18	63	22	85	4	219	20	69	0	0	17	38	19	192	23	72	24	13	3	166	6	76	5	36	21	75	12	177	0	0	-1
1690	0	0	12	120	28	56	10	148	9	132	27	29	14	76	26	70	6	152	24	26	23	36	0	0	7	26	1	116	22	170	16	241	15	184	8	20	30	88	0	0	29	198	11	154	13	190	17	19	19	96	25	158	0	0	-1
1690	-1