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	4	634	198.53	23350.7	
r_0t	x_ijt	q_it	and_so_on
1690	-1
1690	0	0	20	138	4	73	16	164	15	92	8	20	30	88	0	0	29	198	11	77	13	95	17	38	19	161.933	0	0	7	13	1	116	22	170	18	42	2	30	27	58	14	152	21	50	0	0	12	198	28	112	5	24	6	76	3	132	24	13	23	36	0	0	-1
1690	0	0	10	74	9	132	27	29	14	76	26	70	6	152	3	66	24	26	0	0	11	154	13	190	29	99	0	0	25	237	23	72	19	126.066	17	19	0	0	-1
1690	0	0	1	116	22	125.066	4	219	20	138	0	0	12	198	28	112	10	222	7	39	0	0	15	276	8	20	30	88	0	0	-1
1690	0	0	11	154	13	190	29	198	30	44	8	10	0	0	25	79	12	99	28	56	23	72	19	192	17	38	0	0	24	26	3	132	6	152	26	70	14	152	21	50	5	24	0	0	1	58	22	129.933	16	164	18	42	2	45	27	58	9	132	0	0	-1
1690	-1