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