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	5	345	70	24262.4	
r_0t	x_ijt	q_it	and_so_on
1150	-1
1150	0	0	3	59	15	158	12	128	0	0	19	184	0	0	6	138	10	120	9	69	0	0	4	99	11	36	20	71	1	20	14	51	0	0	17	90	18	84	13	16	8	118	5	36	0	0	-1
1150	0	0	16	259.5	0	0	10	60	11	72	4	198	0	0	20	142	7	76	3	59	1	40	0	0	19	92	14	102	2	116	0	0	-1
1150	0	0	3	59	15	158	12	128	0	0	6	138	9	207	0	0	17	90	18	84	13	48	8	59	5	36	0	0	-1
1150	0	0	14	102	8	118	18	42	5	72	0	0	19	184	2	116	0	0	1	40	12	64	7	76	3	118	0	0	4	198	16	88.5	0	0	11	72	20	142	10	120	0	0	-1
1150	-1