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	9	5	824	454.67	37188.9	
r_0t	x_ijt	q_it	and_so_on
2747	0	0	28	95	2	42	36	0	7	90	47	17	10	31	34	47	8	64	0	0	-1
2747	0	0	37	122	6	182	15	74	12	15	41	26	9	140	24	192	17	64	0	0	31	26	20	28	4	59	11	92	38	34	40	174	1	96	18	144	14	154	0	0	25	108	27	19	3	144	21	20	35	76	42	184	29	114	44	152	0	0	26	186	16	152	50	150	22	36	49	102	30	114	0	0	28	95	2	42	45	52	36	40	7	90	33	44	48	64	19	176	13	124	43	84	0	0	-1
2747	0	0	23	88	28	95	43	84	45	104	34	94	8	128	5	192	0	0	2	42	36	80	7	90	10	62	33	22	39	126	47	34	48	128	46	28	19	88	32	90	0	0	-1
2747	0	0	31	13	20	84	4	59	11	46	37	122	38	34	40	174	1	48	18	144	14	77	0	0	35	38	6	182	15	222	12	15	41	26	9	140	24	192	0	0	17	32	29	114	42	184	3	144	27	57	25	108	43	84	28	95	0	0	26	186	16	152	50	75	22	36	49	102	30	57	44	76	0	0	-1
2747	0	0	28	95	2	84	45	104	36	80	13	186	32	90	43	168	0	0	17	64	29	57	30	114	49	51	14	154	50	150	16	76	44	152	0	0	42	92	3	72	24	96	9	70	12	30	21	20	35	76	11	92	1	96	4	118	31	26	22	18	0	0	5	192	8	128	34	94	23	88	0	0	7	180	10	62	33	44	39	126	47	34	48	128	46	28	19	176	0	0	-1
2747	-1