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	4	712	105.79	26420.1	
r_0t	x_ijt	q_it	and_so_on
1898	-1
1898	0	0	2	18	3	94	18	142	26	92	21	33	27	168	9	98	0	0	10	122	17	138	14	130	20	108	11	132	0	0	24	120	22	64	8	110	29	198	7	120	0	0	30	122	0	0	-1
1898	0	0	30	61	2	36	12	198	13	144	5	118	15	86	0	0	9	49	1	82	21	66	16	219	23	95	19	150	0	0	3	188	28	240	4	28	18	71	25	136	0	0	6	192	0	0	-1
1898	0	0	19	50	23	285	26	276	16	73	0	0	10	122	17	138	14	130	20	108	1	82	27	84	0	0	6	64	24	120	22	64	8	110	29	198	7	120	0	0	-1
1898	0	0	25	136	18	142	4	28	28	160	3	188	2	36	0	0	9	98	27	168	21	66	1	164	11	132	0	0	10	61	29	99	15	86	5	118	13	96	12	198	0	0	30	122	0	0	-1
1898	0	0	9	49	20	54	14	65	17	138	24	120	22	32	7	120	0	0	-1