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