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