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	2	1937	580.25	11795.4	
r_0t	x_ijt	q_it	and_so_on
2583	-1
2583	0	0	11	36	18	96	26	130	13	102	34	38	42	188	8	164	15	80	44	44	40	120	10	172	39	102	2	140	12	28	30	114	48	44	6	86	9	34	47	30	17	154	32	34	0	0	21	60	3	136	16	11	28	32	33	58	4	176	27	37	19	99	38	150	5	34	35	24	43	154	29	152	31	64	23	152	45	46	41	164	0	0	-1
2583	0	0	14	276	5	17	38	75	1	237	9	17	6	43	48	22	49	276	32	17	17	77	36	219	20	282	19	81	27	74	4	88	28	16	16	22	3	68	21	30	0	0	41	82	46	39	23	76	31	32	29	76	43	77	24	291	10	86	12	14	2	82	39	51	40	60	44	22	15	40	7	126	8	82	22	228	34	19	13	51	50	120	25	72	26	65	18	48	11	18	37	80	0	0	-1
2583	0	0	37	240	0	0	-1
2583	0	0	21	60	3	136	16	22	28	16	33	58	4	88	27	74	19	120	20	94	47	30	36	73	17	154	32	34	49	92	9	34	6	43	48	44	30	114	22	76	34	38	13	102	50	40	25	24	26	65	41	82	18	96	11	36	14	92	0	0	5	34	35	24	38	150	1	79	12	28	2	148	39	102	10	172	40	120	44	44	15	40	7	42	8	164	42	188	24	97	43	154	29	76	31	64	23	152	46	13	45	46	0	0	-1
2583	-1