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	4	634	141.85	10981.9	
r_0t	x_ijt	q_it	and_so_on
1690	-1
1690	0	0	12	99	28	112	24	13	23	36	19	192	17	38	0	0	11	154	13	190	29	198	0	0	6	76	26	70	14	152	27	58	9	132	7	26	1	116	0	0	22	170	16	164	15	184	8	20	30	88	0	0	-1
1690	0	0	25	237	12	198	10	175	0	0	20	207	4	73	18	62	2	45	27	29	14	76	21	71	28	56	0	0	17	19	19	96	23	72	24	26	3	198	6	152	5	36	0	0	-1
1690	0	0	11	116	13	95	29	198	30	88	8	20	0	0	1	116	22	170	4	219	20	69	0	0	-1
1690	0	0	28	112	26	70	14	152	9	132	27	58	2	30	18	22	1	58	0	0	10	121	7	26	22	85	16	164	15	184	8	10	30	44	0	0	29	99	11	115	13	190	17	38	19	192	0	0	23	72	24	26	3	66	6	152	5	12	21	29	12	198	25	79	0	0	-1
1690	-1