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	50	3	5	767	196.55	17654.1	
r_0t	x_ijt	q_it	and_so_on
2556	-1
2556	0	0	23	51	43	64	25	108	24	196	37	27	21	140	29	50	33	88	2	34	0	0	11	104	50	122	49	166	18	180	40	190	0	0	22	24	17	154	5	47	7	72	34	104	45	108	48	56	12	11	39	27	10	34	38	12	14	32	8	56	47	24	0	0	42	97	13	54	19	192	44	184	30	110	0	0	9	180	41	55	26	97	1	104	31	71	35	49	27	73	32	51	28	76	46	11	0	0	-1
2556	0	0	20	46	3	48	4	19	6	111	16	186	15	61	35	49	31	71	9	90	46	11	36	50	0	0	2	34	42	97	30	55	0	0	-1