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