Inventory Routing Problem - Instances From Archetti et al. (2007)
Best Found Solution - CIRRELT, GERAD & HEC Montreal, QC Canada
inv_cost	Horizon	n	count	m	Q	tot_time	sln_val	
1	2	30	5	2	1131	137.86	8287.95	
r_0t	x_ijt	q_it	and_so_on
1508	-1
1508	0	0	10	36	23	64	19	46	25	89	16	110	14	42	8	112	9	32	2	48	29	196	13	86	4	154	22	18	21	98	0	0	11	88	28	74	30	185	12	196	27	28	18	164	5	124	20	48	26	56	1	40	24	128	0	0	-1
1508	0	0	3	120	30	103	15	105	19	92	25	55	6	123	17	237	7	128	10	72	1	80	0	0	-1
1508	0	0	11	44	28	37	17	79	6	41	16	55	14	126	8	56	9	16	2	24	29	196	4	77	22	54	21	98	18	164	27	14	0	0	24	128	0	0	-1
1508	0	0	11	88	28	74	30	192	15	70	27	28	9	32	8	112	13	86	4	154	29	98	2	48	5	124	0	0	10	72	7	128	23	64	16	110	25	96	19	92	12	196	3	120	20	48	26	56	1	80	24	64	0	0	-1
1508	-1