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	3	1291	372.7	13789	
r_0t	x_ijt	q_it	and_so_on
2583	-1
2583	0	0	21	60	3	136	16	11	28	32	33	58	4	176	27	74	19	120	20	188	32	34	17	154	47	30	38	150	5	34	0	0	9	17	6	86	48	44	12	28	2	74	39	102	10	86	40	120	44	22	15	80	8	82	42	188	24	194	43	154	0	0	14	92	41	164	45	46	46	26	23	152	29	152	31	64	22	152	34	38	13	102	50	80	18	48	11	36	37	80	0	0	-1
2583	0	0	11	18	18	96	26	195	25	48	13	51	34	19	8	164	7	126	15	40	44	44	40	60	10	172	39	51	2	148	12	14	9	34	0	0	21	30	16	22	36	219	17	77	32	17	49	276	48	22	30	171	1	237	38	75	35	24	5	17	0	0	-1
2583	0	0	14	276	45	46	46	26	23	152	31	64	29	152	43	154	19	120	27	74	3	136	0	0	37	231	0	0	-1
2583	0	0	21	60	3	68	16	22	28	48	33	58	36	73	17	154	32	34	49	92	47	30	20	229	38	150	19	60	27	37	4	176	0	0	37	9	11	36	18	96	26	65	25	48	50	80	13	102	34	38	22	152	7	42	8	164	42	188	24	194	43	77	0	0	41	164	23	76	31	32	15	47	44	44	40	120	10	172	39	102	2	148	12	28	30	57	48	44	6	86	9	34	1	79	35	24	5	34	0	0	-1
2583	-1