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	3	575	76.96	10929.8	
r_0t	x_ijt	q_it	and_so_on
1150	-1
1150	0	0	17	90	18	84	8	118	3	59	1	20	4	198	0	0	6	138	10	120	12	128	20	71	11	36	14	51	0	0	19	184	0	0	-1
1150	0	0	9	173	10	60	20	142	11	72	2	116	0	0	14	102	16	261	0	0	3	59	1	40	12	64	15	237	7	90	13	48	5	36	0	0	-1
1150	0	0	5	108	18	84	8	118	3	118	4	119	0	0	19	184	0	0	-1
1150	0	0	9	103	10	120	20	142	11	72	6	138	0	0	2	116	4	178	16	87	14	102	19	92	0	0	3	59	1	40	12	128	15	79	7	62	13	16	8	59	18	42	17	90	0	0	-1
1150	-1