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