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	3	845	194.4	9771.51	
r_0t	x_ijt	q_it	and_so_on
1690	-1
1690	0	0	29	198	11	154	13	190	17	38	19	192	0	0	10	148	28	112	14	152	21	50	5	24	6	76	3	132	24	13	23	72	0	0	12	99	27	58	2	30	18	42	1	58	22	85	16	164	15	184	8	20	30	88	0	0	-1
1690	0	0	20	207	4	204	22	170	1	116	7	39	0	0	25	237	19	96	17	19	0	0	23	36	24	26	6	152	26	105	14	76	27	29	9	153	28	56	12	198	0	0	-1
1690	0	0	8	20	30	88	29	198	13	190	11	154	0	0	-1
1690	0	0	12	198	5	24	6	152	3	143	24	26	23	72	19	192	17	38	0	0	10	148	7	13	18	42	2	45	27	58	9	111	14	152	26	35	21	50	28	112	25	79	0	0	1	116	22	170	4	88	20	69	16	164	15	184	8	10	30	44	0	0	-1
1690	0	0	11	154	13	95	29	198	0	0	-1