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	5	822	352.49	17496.4	
r_0t	x_ijt	q_it	and_so_on
2740	-1
2740	0	0	27	20	33	128	9	194	1	64	47	17	41	46	0	0	15	182	49	152	11	120	29	184	2	25	45	134	0	0	40	56	46	30	44	28	31	188	30	26	26	124	38	154	18	78	13	136	0	0	19	56	39	69	16	128	20	80	42	184	48	80	6	0	10	186	8	20	0	0	22	158	28	90	36	46	35	102	43	84	14	50	23	56	25	138	24	95	0	0	-1
2740	0	0	19	112	42	92	5	46	4	132	31	94	17	108	26	62	18	39	3	58	2	50	0	0	10	93	6	184.4	12	48	21	180	16	64	39	138	37	97	0	0	45	67	32	177	50	184	24	190	41	23	7	69	34	61	0	0	-1
2740	0	0	32	59	10	93	48	80	20	80	5	138	4	44	30	26	44	28	46	30	8	10	40	168	0	0	7	207	34	183	47	51	1	64	9	194	27	20	0	0	25	138	23	56	14	50	43	84	37	291	28	90	22	79	0	0	-1
2740	0	0	28	45	21	180	16	128	39	138	36	69	35	102	43	42	14	25	25	69	0	0	27	10	33	128	9	97	41	46	24	190	50	184	22	158	0	0	13	136	3	58	18	78	26	124	38	231	49	152	0	0	45	134	2	50	29	276	11	120	15	182	0	0	8	20	10	93	6	95.6	19	112	12	32	42	184	20	40	31	94	17	108	46	15	0	0	-1
2740	-1