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	7	5	775	427.04	17977.9	
r_0t	x_ijt	q_it	and_so_on
2583	-1
2583	0	0	27	74	19	120	47	15	49	184	32	34	17	154	36	146	16	22	0	0	21	60	3	136	0	0	24	194	1	158	30	114	9	34	38	150	5	34	33	58	28	32	0	0	35	24	6	86	48	44	12	28	2	74	39	102	10	86	40	120	44	44	15	80	8	82	0	0	43	77	31	64	22	152	34	38	13	102	50	80	23	152	18	48	11	36	0	0	-1
2583	0	0	42	282	15	40	7	126	8	164	31	32	46	39	45	69	0	0	5	17	38	75	9	17	6	43	48	22	12	14	2	148	39	51	10	172	40	60	44	22	34	19	13	51	25	55	0	0	3	68	28	16	20	282	4	264	0	0	14	276	41	246	37	181	0	0	43	154	29	228	23	76	26	195	18	96	11	18	0	0	-1
2583	0	0	16	22	36	146	32	34	17	154	47	45	20	94	19	120	27	74	33	58	0	0	21	60	0	0	-1
2583	0	0	33	29	17	77	32	17	49	184	9	34	6	43	48	44	30	114	1	175	35	24	5	34	0	0	37	139	14	92	38	150	19	60	27	37	4	88	28	32	16	11	3	136	21	30	0	0	29	79	7	42	15	40	44	44	40	120	39	102	2	148	12	28	10	172	0	0	41	82	45	23	31	64	8	164	42	94	24	194	43	154	0	0	46	13	23	152	22	152	34	38	13	102	50	80	25	41	26	65	18	96	11	36	0	0	-1
2583	-1