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	5	5	452	179.07	23808.9	
r_0t	x_ijt	q_it	and_so_on
1508	-1
1508	0	0	30	96	17	158	27	28	18	164	0	0	7	64	23	64	16	110	25	96	19	64.333	15	0	28	37	0	0	24	128	26	56	1	80	10	72	0	0	22	18	4	154	13	86	9	32	8	112	14	42	0	0	11	44	5	62	2	48	29	196	21	98	0	0	-1
1508	0	0	6	123	25	48	19	73.666	12	196	0	0	20	48	3	60	15	105	30	96	28	37	11	88	0	0	-1
1508	0	0	24	128	1	40	10	72	7	192	0	0	3	60	30	192	17	158	28	37	0	0	15	35	6	41	16	93.666	14	126	8	56	9	16	27	14	5	62	0	0	21	98	22	54	4	77	29	196	2	24	0	0	-1
1508	0	0	24	64	29	98	4	154	13	86	2	48	0	0	11	88	3	120	20	48	26	56	1	80	0	0	28	74	19	92	25	96	16	71.333	23	64	10	36	0	0	30	96	12	196	5	124	0	0	27	28	8	112	9	32	18	246	0	0	-1
1508	-1