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