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