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	4	566	199.07	22435.9	
r_0t	x_ijt	q_it	and_so_on
1508	-1
1508	0	0	1	80	26	56	20	24	18	164	27	28	12	196	0	0	21	98	29	196	13	43	4	154	22	36	0	0	24	64	11	44	28	37	30	192	17	157	10	72	0	0	19	64	25	96	16	110	14	42	8	112	9	32	2	48	5	62	0	0	-1
1508	0	0	10	36	7	128	23	68	19	74	6	123	15	105	0	0	24	128	3	60	11	44	28	37	0	0	-1
1508	0	0	11	44	28	37	17	159	30	126	3	60	20	72	1	40	0	0	27	14	18	164	2	24	9	16	8	56	14	42	16	55	25	96	6	41	15	35	0	0	21	98	29	196	4	77	13	129	5	62	0	0	-1
1508	0	0	28	74	7	128	10	72	1	80	26	56	24	128	0	0	5	124	18	82	2	48	29	98	4	154	22	54	0	0	11	88	30	162	12	196	3	120	0	0	23	60	25	48	19	92	16	110	14	84	8	112	9	32	27	28	0	0	-1
1508	-1