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	20	5	3	575	74.09	19637.7	
r_0t	x_ijt	q_it	and_so_on
1150	-1
1150	0	0	10	120	11	72	20	142	12	128	1	20	3	59	0	0	14	102	8	118	18	84	17	90	0	0	4	198	16	174	19	184	0	0	-1
1150	0	0	19	92	2	58	6	207	10	60	9	138	0	0	5	36	18	42	13	16	7	38	15	237	1	40	3	118	0	0	-1
1150	0	0	2	174	6	69	4	154	14	51	0	0	5	36	8	59	13	48	7	114	15	79	12	91	20	71	11	36	0	0	-1
1150	0	0	19	184	5	72	8	118	18	84	17	117	0	0	11	72	20	142	12	101	1	40	3	118	14	102	0	0	9	138	10	120	4	143	16	174	0	0	-1
1150	-1