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	7	5	775	506.19	38155.9	
r_0t	x_ijt	q_it	and_so_on
2583	-1
2583	0	0	26	130	25	24	50	40	13	102	34	38	22	152	24	194	43	77	0	0	21	60	3	136	33	58	27	74	19	120	38	150	4	176	0	0	28	32	20	188	47	15	49	184	32	34	17	154	36	146	16	11	0	0	5	34	9	34	6	86	48	44	12	28	2	74	39	51	10	86	40	120	44	22	15	80	8	82	0	0	14	92	45	46	29	152	31	64	23	152	46	26	18	96	11	36	37	80	0	0	-1
2583	0	0	21	30	3	68	16	22	28	16	4	88	38	75	9	17	6	43	48	22	30	114	1	237	35	24	5	17	0	0	7	126	15	40	44	44	40	60	39	102	2	148	12	14	10	172	0	0	43	154	42	248	8	164	31	32	29	76	41	82	0	0	-1
2583	0	0	45	46	46	26	23	152	22	152	34	38	13	102	50	120	25	72	18	48	0	0	14	97	41	246	26	130	11	36	37	240	0	0	4	88	27	37	19	60	20	188	47	45	17	82	32	34	36	146	28	16	0	0	-1
2583	0	0	5	34	35	24	1	158	9	34	6	86	49	184	32	17	17	149	36	73	28	16	0	0	21	60	3	136	16	22	33	87	27	74	19	120	38	150	4	88	0	0	10	172	44	44	40	120	39	102	2	148	12	28	48	44	30	114	0	0	24	291	42	128	8	164	15	80	7	42	34	19	13	51	0	0	11	18	18	96	45	23	46	13	23	76	31	64	29	152	43	154	14	179	0	0	-1
2583	-1