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	
2	2	30	5	3	754	186.45	21058.2	
r_0t	x_ijt	q_it	and_so_on
1508	-1
1508	0	0	11	44	30	192	15	35	19	92	25	96	6	60.2	17	79	28	74	0	0	10	72	23	64	16	110	14	42	8	112	9	32	18	164	27	28	12	98	0	0	1	40	21	49	22	18	4	154	13	86	29	196	2	48	5	62	24	64	0	0	-1
1508	0	0	7	128	11	44	3	60	20	48	26	56	1	80	24	128	0	0	-1
1508	0	0	3	60	12	98	27	14	9	16	8	56	14	126	16	55	25	96	19	92	6	103.8	28	37	0	0	5	62	18	164	2	24	29	196	4	77	22	54	21	147	0	0	10	72	17	237	15	105	30	98.8	11	44	24	64	0	0	-1
1508	0	0	12	196	27	28	19	46	25	48	16	110	23	64	7	128	10	36	0	0	18	82	9	32	8	112	13	86	4	154	29	98	2	48	5	124	0	0	11	88	28	74	30	189.2	3	120	20	48	26	56	1	80	24	64	0	0	-1
1508	-1