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