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	3	949	195.5	25216.3	
r_0t	x_ijt	q_it	and_so_on
1898	-1
1898	0	0	30	122	6	128	10	122	0	0	11	66	14	130	17	138	24	120	22	64	8	110	29	198	7	120	0	0	9	98	20	108	27	84	21	66	16	146	18	142	28	160	3	94	2	18	0	0	-1
1898	0	0	25	136	18	71	19	150	23	95	26	184	27	168	1	82	9	49	0	0	15	86	5	118	13	144	12	198	4	28	3	188	2	36	30	61	0	0	-1
1898	0	0	19	50	23	95	16	146	21	33	1	246	11	198	6	128	0	0	20	54	14	65	17	138	24	120	22	32	8	110	29	198	7	120	10	61	0	0	-1
1898	0	0	30	122	9	98	20	108	14	130	17	69	24	60	22	64	29	99	7	60	10	122	0	0	3	188	4	28	28	235	12	198	13	96	5	118	15	86	0	0	27	168	21	66	26	184	23	190	18	142	25	136	2	36	0	0	-1
1898	-1