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	1	35	3	5	653	86.04	5921.12	
r_0t	x_ijt	q_it	and_so_on
2176	-1
2176	0	0	4	120	33	28	34	108	12	164	28	78	1	61	11	89	0	0	17	72	9	198	3	95	35	69	18	71	13	116	0	0	15	36	2	51	16	98	8	80	6	92	22	162	20	86	0	0	31	96	24	96	21	14	23	33	27	61	5	136	32	126	30	30	10	61	0	0	19	36	25	74	26	188	29	174	7	113	14	68	0	0	-1
2176	-1