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	3	5	569	213.14	27490.1	
r_0t	x_ijt	q_it	and_so_on
1898	-1
1898	0	0	20	54	14	130	17	138	24	120	10	122	0	0	22	64	8	110	29	198	7	120	15	43	0	0	2	36	25	68	18	142	3	94	4	14	13	96	12	99	0	0	30	122	6	128	0	0	19	100	26	184	21	33	27	84	9	98	0	0	-1
1898	0	0	9	49	27	168	1	164	20	108	11	66	0	0	30	61	18	71	3	94	28	240	5	59	0	0	19	50	23	190	16	219	21	66	0	0	-1
1898	0	0	25	68	5	177	15	129	0	0	11	198	14	65	17	138	6	128	0	0	10	61	22	32	8	110	29	198	7	120	0	0	12	297	13	96	4	42	3	94	2	18	0	0	-1
1898	0	0	25	136	18	142	28	103	3	188	0	0	19	100	27	168	21	66	1	164	6	64	0	0	2	36	23	190	26	184	16	146	0	0	17	69	14	130	20	108	9	98	30	122	0	0	10	122	24	180	22	64	29	99	7	60	0	0	-1
1898	-1