Inventory Routing Problem - Instances From Archetti et al. (2012)
Best Found Solution - CIRRELT, GERAD & HEC Montreal, QC Canada
inv_cost	Horizon	n	count	m	Q	tot_time	sln_val	
2	6	50	3	5	784	651.61	35044.4	
r_0t	x_ijt	q_it	and_so_on
2612	-1
2612	0	0	5	76	7	72	34	104	45	108	48	56	12	11	39	27	10	34	38	12	14	32	8	56	29	50	33	88	32	51	0	0	11	104	47	24	28	38	40	95.2	18	90	50	61	49	166	17	154	22	24	0	0	30	110	13	54	19	192	3	120	20	92	44	184	0	0	23	51	25	108	4	56	6	74	24	196	37	27	21	140	16	124	0	0	42	97	9	180	1	52	15	61	35	98	31	142	46	22	2	50	0	0	-1
2612	0	0	36	100	28	76	27	146	40	189.8	18	180	50	61	0	0	42	97	19	96	43	64	1	52	26	194	41	123	9	90	2	50	0	0	-1
2612	0	0	42	97	1	52	23	51	43	64	25	54	4	168	19	96	13	54	44	92	0	0	35	49	15	183	6	74	24	196	37	81	21	70	16	124	0	0	2	50	46	11	9	90	41	41	31	71	32	51	33	88	49	166	17	154	22	12	0	0	11	52	50	61	7	72	34	104	45	108	48	56	12	33	39	81	10	17	38	36	14	96	8	56	47	12	0	0	-1
2612	0	0	2	100	47	24	28	76	27	146	35	98	31	142	26	194	0	0	42	194	23	102	25	108	43	128	1	104	9	90	0	0	36	100	40	190	18	180	49	83	50	122	11	104	0	0	46	22	32	102	33	44	29	75	21	140	10	34	48	28	45	54	34	52	7	36	5	76	17	77	22	24	0	0	30	165	13	27	19	96	3	120	20	92	44	184	0	0	-1
2612	-1