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	8	4	831	614.83	17520.4	
r_0t	x_ijt	q_it	and_so_on
2217	-1
2217	0	0	5	57	44	50.04	1	126	38	92	50	116	33	142	30	24	21	40	29	44	25	78	0	0	19	29	32	31	9	44	43	70	39	57	4	146	45	37	47	16	48	176	22	94	11	64	2	58	0	0	36	56	34	33	41	184	23	60	31	46	8	28	13	57	10	116	40	29	26	68	17	99	37	26	0	0	18	30	16	178	15	114	24	192	46	28	20	16	27	28	42	186	49	26	0	0	-1
2217	0	0	19	58	32	62	28	168	12	45	9	88	35	75	3	50	6	44	23	120	14	120	0	0	36	112	34	33	7	63	0	0	-1
2217	0	0	34	33	41	92	28	56	12	15	35	25	43	70	31	23	39	171	8	84	13	171	11	32	2	58	0	0	49	26	42	93	27	84	20	48	46	28	16	89	24	96	15	73.04	29	44	21	20	25	78	44	145.96	0	0	5	171	37	78	17	297	26	68	40	87	36	56	0	0	1	63	38	92	30	12	33	71	50	116	22	94	48	88	47	48	4	73	45	111	10	58	0	0	-1
2217	0	0	36	56	41	184	23	120	6	44	14	80	7	42	0	0	34	66	19	58	32	62	9	88	3	50	43	35	31	46	10	116	2	116	38	46	1	126	0	0	49	52	42	186	27	28	20	0	46	14	24	192	15	97.96	16	178	18	30	0	0	25	39	29	22	21	40	30	24	33	142	50	58	22	47	48	176	4	146	11	64	26	34	0	0	-1
2217	-1