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