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	6	5	885	517.77	40536.8	
r_0t	x_ijt	q_it	and_so_on
2951	0	0	9	80	45	98	14	55	13	45	11	94	0	0	-1
2951	0	0	25	99	44	168	22	30	17	108	7	126	42	190	16	48	0	0	27	92	32	186	20	164	2	182	33	78	0	0	29	82	46	13	47	28	10	48	28	67	40	91	43	58	12	26	18	162	38	28	19	184	11	94	0	0	50	46	23	186	1	190	35	178	31	84	48	92	14	55	13	45	0	0	26	190	41	72	45	98	9	80	5	134	21	80	37	88	49	134	0	0	-1
2951	0	0	30	22	29	41	46	26	6	128	4	24	28	134	24	194	39	90	40	182	10	24	47	14	0	0	13	45	14	55	41	72	45	98	9	80	5	67	34	282	15	46	44	84	0	0	25	198	11	94	8	92	3	21	36	90	2	91	33	156	0	0	-1
2951	0	0	22	30	16	48	34	94	9	80	45	98	41	72	26	190	37	88	49	134	50	23	38	28	0	0	27	92	32	93	20	164	36	270	3	63	11	94	0	0	19	184	18	162	12	13	43	58	1	95	35	156	48	92	21	80	13	45	0	0	-1
2951	0	0	8	92	47	28	10	48	18	81	12	26	43	29	23	186	1	190	49	67	50	46	19	92	0	0	26	95	41	144	45	98	9	80	5	134	31	84	35	111	13	45	11	94	0	0	25	198	33	156	2	182	20	82	30	22	32	186	0	0	44	168	22	15	15	46	17	111	7	126	42	285	16	24	14	110	0	0	29	82	46	26	6	128	4	24	28	134	24	194	39	90	40	182	38	14	0	0	-1
2951	-1