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	10	4	1028	324.86	15313.6	
r_0t	x_ijt	q_it	and_so_on
2740	-1
2740	0	0	8	20	32	81.52	22	158	24	190	41	46	7	138	34	122	47	34	9	97	27	10	0	0	3	29	18	78	26	124	38	154	49	152	11	120	29	184	2	50	45	134	0	0	15	91	13	68	46	15	44	28	30	26	31	188	20	80	42	184	19	112	12	32	37	97	28	90	0	0	25	138	23	56	14	50	43	84	35	102	36	46	39	138	16	128	21	180	10	93	0	0	-1
2740	0	0	46	30	17	108	4	132	5	92	48	120	6	70	10	186	50	184	40	56	0	0	27	20	1	96	9	194	33	64	0	0	-1
2740	0	0	33	64	0	0	41	46	24	95	25	69	23	56	14	50	43	84	39	69	16	128	37	291	28	45	22	79	0	0	40	168	32	154.48	13	204	3	87	15	273	45	134	0	0	2	25	18	78	26	124	30	26	31	188	4	44	20	40	42	184	19	56	6	210	8	10	0	0	-1
2740	0	0	22	158	24	190	41	23	7	138	47	34	1	64	9	194	33	128	27	20	0	0	18	39	26	62	38	231	49	152	11	120	29	276	2	50	45	67	0	0	50	184	10	186	19	112	48	80	42	92	20	80	5	92	17	108	44	42	46	30	8	20	0	0	28	90	12	48	21	180	16	64	39	138	36	69	35	102	43	42	14	25	25	138	34	122	0	0	-1
2740	-1