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