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	3	754	154.22	9332.27	
r_0t	x_ijt	q_it	and_so_on
1508	-1
1508	0	0	21	98	22	36	29	196	4	154	13	86	8	96.6	9	32	2	48	0	0	24	128	1	80	26	28	20	24	3	60	11	88	28	74	0	0	10	72	23	64	16	110	25	96	19	92	27	28	15	70	30	192	0	0	-1
1508	0	0	21	49	4	77	29	98	2	24	9	16	8	71.4	14	126	16	55	25	48	19	46	6	123	0	0	11	44	28	37	30	96	17	237	7	187.8	10	36	0	0	12	294	27	14	18	246	5	186	0	0	-1
1508	0	0	1	80	26	84	20	72	3	180	24	128	0	0	-1
1508	0	0	11	88	28	74	30	192	17	79	23	64	7	68.2	10	72	0	0	12	98	27	28	9	32	8	112	14	42	16	110	25	96	19	92	6	41	15	70	0	0	5	62	18	82	2	48	29	196	13	86	4	154	22	36	21	49	1	40	0	0	-1
1508	0	0	24	128	0	0	-1