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	4	712	153.03	10929.9	
r_0t	x_ijt	q_it	and_so_on
1898	-1
1898	0	0	6	64	17	138	14	130	20	108	11	132	0	0	10	122	22	64	8	110	29	198	0	0	2	36	18	142	3	188	28	160	12	165.733	0	0	30	122	27	168	21	66	1	164	9	98	0	0	-1
1898	0	0	9	49	27	84	21	33	16	219	26	276	0	0	25	204	18	71	23	284.866	19	150	0	0	10	61	24	180	22	32	29	99	7	180	15	129	0	0	2	18	3	94	4	42	12	131.266	13	144	5	177	0	0	-1
1898	0	0	6	192	17	138	14	130	20	108	30	122	0	0	-1
1898	0	0	11	132	20	54	1	164	21	66	27	168	9	98	0	0	25	68	18	142	19	50	23	95.133	26	92	16	73	14	65	17	69	0	0	7	60	29	198	8	110	22	64	24	60	10	122	0	0	15	43	5	59	13	48	12	99	28	160	4	14	3	188	2	36	30	61	0	0	-1
1898	-1