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	4	980	488.83	33463.3	
r_0t	x_ijt	q_it	and_so_on
2612	-1
2612	0	0	2	50	28	76	40	190	18	180	50	122	49	166	17	154	22	12	0	0	30	110	44	184	20	46	3	60	19	192	13	54	9	180	42	97	0	0	47	12	33	88	29	50	21	140	37	27	24	196	6	74	4	56	25	108	43	64	23	51	1	104	0	0	11	104	7	72	34	104	45	108	48	56	10	34	16	124	15	61	35	98	31	142	46	11	0	0	-1
2612	0	0	42	97	26	194	41	123	9	90	46	22	2	100	0	0	36	50	47	24	27	146	32	102	33	44	8	84	14	64	38	24	10	17	39	54	12	22	48	28	45	54	34	52	7	36	5	76	17	77	22	24	0	0	-1
2612	0	0	43	64	25	54	4	168	6	74	24	196	37	81	21	70	16	124	15	61	35	49	0	0	11	52	50	61	49	166	18	180	40	190	28	76	41	41	9	90	42	97	0	0	36	50	31	71	1	52	23	51	19	192	13	54	3	180	20	138	44	184	0	0	30	110	0	0	-1
2612	0	0	42	194	2	100	36	100	47	24	40	95	18	90	49	83	50	122	11	104	0	0	28	38	33	88	8	56	14	64	38	24	10	34	39	54	12	22	48	56	45	108	34	104	7	72	5	76	17	154	22	24	0	0	31	142	35	98	15	122	16	62	21	140	29	75	32	102	27	146	46	22	0	0	9	90	41	27.2	26	194	1	104	23	102	43	128	25	108	19	96	13	27	44	92	0	0	-1
2612	-1