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	1	35	3	1	3264	43.3	14421.9	
r_0t	x_ijt	q_it	and_so_on
2176	-1
2176	0	0	19	36	7	168	29	174	26	94	34	108	12	82	33	28	4	120	5	68	32	126	30	42	22	162	6	184	8	160	16	98	2	51	3	95	35	69	18	71	13	116	9	198	15	36	17	72	20	86	10	61	24	96	25	74	0	0	-1
2176	0	0	31	96	21	14	23	33	27	61	5	68	11	89	1	61	28	234	12	82	34	54	26	94	29	87	14	68	0	0	-1