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	4	566	150.61	10638	
r_0t	x_ijt	q_it	and_so_on
1508	-1
1508	0	0	10	72	7	128	30	192	28	74	11	88	0	0	19	92	25	96	16	110	14	84	8	58.866	9	32	27	28	0	0	2	48	29	196	4	154	21	98	0	0	26	56	1	80	24	128	0	0	-1
1508	0	0	27	14	9	16	8	109.133	13	129	4	77	22	54	29	98	2	24	0	0	17	237	12	294	0	0	10	36	23	96	16	55	25	48	19	46	6	123	15	105	30	0	0	0	20	72	5	173.933	18	246	3	60	0	0	-1
1508	0	0	11	88	28	74	30	192	3	180	0	0	24	128	1	80	0	0	-1
1508	0	0	2	48	29	196	13	43	4	154	22	18	21	98	0	0	12	98	27	28	19	92	25	96	6	41	17	79	15	35	30	96	0	0	20	24	5	74.066	18	82	9	32	8	112	14	84	16	110	23	32	0	0	24	64	26	56	1	40	10	72	7	128	28	37	11	44	0	0	-1
1508	-1