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	5	5	452	138.97	12183	
r_0t	x_ijt	q_it	and_so_on
1508	-1
1508	0	0	6	82	25	96	19	92	16	110	10	72	0	0	18	164	2	24	9	16	8	56	27	14	12	178	0	0	1	80	4	77	29	196	21	98	0	0	30	192	17	158	28	74	0	0	24	128	3	120	11	88	0	0	-1
1508	0	0	24	64	0	0	27	28	9	32	8	112	14	84	16	55	23	86	10	36	0	0	2	48	29	98	13	88	4	154	22	54	0	0	7	64	15	70	5	124	20	48	26	56	1	40	0	0	-1
1508	0	0	7	192	28	37	0	0	11	44	30	192	12	214	0	0	17	158	6	82	25	96	19	92	0	0	-1
1508	0	0	11	88	28	74	30	96	15	70	25	48	19	46	27	28	0	0	10	72	23	42	16	110	14	84	8	112	9	32	0	0	24	128	3	120	20	48	26	56	1	80	0	0	5	124	18	164	2	48	21	116	0	0	29	196	13	84	4	154	22	18	0	0	-1
1508	-1