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	5	569	121.11	11829.1	
r_0t	x_ijt	q_it	and_so_on
1898	-1
1898	0	0	11	132	14	130	17	138	6	128	0	0	10	122	22	32	29	198	7	120	0	0	2	18	3	94	18	142	25	136	30	122	0	0	19	100	23	95	26	92	16	146	21	66	0	0	9	98	20	108	1	164	27	168	0	0	-1
1898	0	0	10	61	24	148	22	64	8	110	29	99	7	60	0	0	12	198	13	144	28	168	4	28	0	0	15	86	5	177	3	188	18	71	2	36	0	0	-1
1898	0	0	9	98	20	54	14	130	17	138	6	128	0	0	30	122	19	100	23	285	0	0	26	276	16	146	21	33	27	84	0	0	-1
1898	0	0	9	49	20	108	14	65	17	69	24	92	22	64	10	122	0	0	15	86	8	110	29	198	7	120	0	0	2	36	4	28	28	152	12	198	13	96	5	59	0	0	30	61	25	136	18	142	3	188	0	0	27	168	21	66	1	164	11	132	0	0	-1
1898	-1