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