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	5	272	26	11448.5	
r_0t	x_ijt	q_it	and_so_on
907	-1
907	0	0	1	156	13	110	0	0	3	44	11	188	0	0	14	172	0	0	12	60	2	120	8	76	0	0	-1
907	0	0	14	86	7	164	6	22	0	0	15	38	9	141	8	38	13	55	0	0	5	272	0	0	4	130	0	0	3	88	10	184	0	0	-1
907	0	0	7	64	11	188	0	0	2	272	0	0	5	108	1	78	12	30	0	0	-1
907	0	0	10	176	12	60	0	0	4	130	0	0	14	172	3	88	0	0	6	22	9	94	8	76	15	38	0	0	13	110	1	156	0	0	-1
907	-1