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	3	2	1424	129.48	8692.07	
r_0t	x_ijt	q_it	and_so_on
1898	-1
1898	0	0	9	98	27	168	21	66	20	108	14	130	17	138	24	102	22	64	8	55	29	198	7	120	10	122	0	0	2	18	3	94	18	124	30	122	0	0	-1
1898	0	0	2	36	25	136	18	89	3	188	4	28	28	240	12	198	13	144	5	177	15	86	0	0	6	192	11	66	9	49	1	164	27	84	21	33	16	219	26	184	23	190	19	150	30	61	0	0	-1
1898	0	0	10	122	7	120	29	198	8	165	22	32	24	138	17	138	14	130	20	108	11	198	6	64	0	0	-1
1898	0	0	30	122	2	36	25	136	18	142	3	188	4	28	28	80	12	198	13	96	5	59	15	86	29	99	22	64	10	61	0	0	17	69	14	65	16	146	26	184	23	190	19	100	27	168	21	66	1	164	20	54	9	98	0	0	-1
1898	-1