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	1	2262	74.95	7441.65	
r_0t	x_ijt	q_it	and_so_on
1508	-1
1508	0	0	10	72	7	64	23	32	6	82	25	96	19	92	16	110	14	84	8	56	9	16	13	86	4	77	29	196	2	24	18	164	27	14	15	35	17	79	30	192	28	74	11	88	3	120	26	56	1	40	24	128	0	0	-1
1508	0	0	12	294	27	28	8	112	9	32	2	48	29	98	4	154	22	54	21	147	5	124	20	48	1	80	24	64	0	0	-1
1508	0	0	10	72	7	192	23	96	16	110	25	96	19	92	6	82	17	237	15	105	30	192	28	37	11	44	0	0	-1
1508	0	0	24	128	1	80	26	56	20	48	3	120	5	124	18	246	2	48	21	98	22	18	29	196	4	154	13	86	9	32	8	112	14	84	16	55	25	48	19	46	27	28	12	98	30	96	28	74	11	88	10	36	0	0	-1
1508	-1