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	6	3	1475	690.19	36342.4	
r_0t	x_ijt	q_it	and_so_on
2951	0	0	9	80	45	98	14	55	13	45	11	94	0	0	-1
2951	0	0	32	186	27	92	30	22	20	164	2	182	33	78	0	0	11	94	19	184	14	55	45	98	41	72	5	134	48	92	35	89	1	95	43	58	12	13	18	162	40	91	28	67	10	48	47	28	46	13	29	82	0	0	38	28	50	23	49	134	37	88	26	95	9	80	34	188	16	48	42	190	7	63	17	108	15	23	22	30	44	168	25	198	0	0	-1
2951	0	0	3	63	8	92	47	14	38	14	50	46	23	186	43	29	12	26	18	81	40	182	39	90	24	194	10	24	28	134	4	24	6	128	46	26	29	41	0	0	2	91	20	82	36	180	33	156	0	0	11	94	13	90	14	55	45	98	9	80	41	72	26	190	21	120	48	46	31	84	35	178	1	190	49	67	19	92	0	0	-1
2951	0	0	27	92	32	93	44	168	25	126	0	0	11	94	13	45	14	55	41	72	45	98	9	80	5	134	34	188	16	48	42	190	7	189	17	108	15	69	22	30	0	0	-1
2951	0	0	30	22	29	82	46	26	6	128	4	24	28	134	10	48	24	194	39	90	40	182	18	162	12	26	43	58	23	186	50	46	38	28	47	28	0	0	32	186	33	156	2	182	20	164	36	180	3	21	8	92	19	184	13	45	11	94	25	171	0	0	16	24	5	67	9	80	45	98	41	144	26	190	21	80	48	46	31	84	35	178	1	190	49	134	37	105	14	55	0	0	-1
2951	-1