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