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	1	1725	38.66	16028.1	
r_0t	x_ijt	q_it	and_so_on
1150	-1
1150	0	0	19	184	14	102	5	72	18	84	8	59	3	118	1	40	12	128	20	71	11	36	10	120	9	69	6	138	4	99	2	58	0	0	-1
1150	0	0	19	92	16	174	4	198	11	72	20	71	15	237	7	38	13	32	8	118	18	42	17	135	0	0	-1
1150	0	0	19	92	14	51	3	59	1	20	7	114	15	79	12	64	20	71	10	120	9	207	6	138	2	174	0	0	-1
1150	0	0	19	92	14	102	16	174	4	198	10	60	11	72	20	142	12	128	1	40	3	118	13	32	8	118	18	84	5	72	17	90	0	0	-1
1150	-1