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	15	3	2	680	41.43	7269.58	
r_0t	x_ijt	q_it	and_so_on
907	-1
907	0	0	14	86	15	38	8	76	13	110	1	78	12	54	10	90	5	95	0	0	4	130	3	88	0	0	-1
907	0	0	14	172	7	171	6	33	11	282	0	0	12	36	1	156	13	55	2	254	9	141	8	38	0	0	-1
907	0	0	3	44	10	270	5	285	0	0	-1
907	0	0	14	172	7	57	6	11	11	94	9	94	2	138	8	76	15	38	0	0	4	130	3	88	13	110	1	156	12	60	0	0	-1
907	-1