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