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