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	2	1131	220.42	19889.3	
r_0t	x_ijt	q_it	and_so_on
1508	-1
1508	0	0	27	14	18	164	2	48	9	32	8	112	13	43	4	154	29	196	22	36	21	98	5	62	20	48	26	28	1	80	0	0	24	128	11	44	28	74	30	96	15	70	25	96	19	92	14	42	16	110	23	64	7	64	10	72	0	0	-1
1508	0	0	11	88	30	192	17	237	6	123	25	48	19	46	27	28	12	196	3	60	24	64	0	0	-1
1508	0	0	3	60	5	62	18	164	2	24	29	196	4	77	13	129	9	16	8	56	14	42	16	110	6	41	17	79	28	37	0	0	7	192	10	72	1	45	26	84	0	0	-1
1508	0	0	24	128	3	120	12	196	27	28	19	92	25	96	15	105	30	192	28	74	11	88	0	0	1	75	20	48	5	124	21	147	22	54	4	154	29	98	2	48	9	32	8	112	14	84	16	55	23	64	10	36	0	0	-1
1508	-1