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	15	3	5	272	44.01	19003	
r_0t	x_ijt	q_it	and_so_on
907	-1
907	0	0	6	22	9	94	7	114	0	0	14	172	3	44	0	0	10	90	12	30	4	65	0	0	1	78	13	110	8	76	0	0	-1
907	0	0	12	60	1	156	0	0	15	19	2	196	8	38	0	0	5	190	0	0	11	188	3	44	0	0	-1
907	0	0	4	195	0	0	14	86	7	114	6	22	3	44	0	0	13	110	9	94	15	57	0	0	10	270	0	0	-1
907	0	0	1	156	13	55	12	60	0	0	14	172	3	88	0	0	11	188	0	0	2	196	8	76	0	0	5	190	0	0	-1
907	-1