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	4	340	30.24	9785.58	
r_0t	x_ijt	q_it	and_so_on
907	-1
907	0	0	9	68	2	196	8	76	0	0	10	122	13	110	1	78	12	30	0	0	14	172	3	88	0	0	7	114	6	11	11	188	15	19	0	0	-1
907	0	0	5	285	0	0	12	60	13	55	1	156	0	0	4	130	0	0	-1
907	0	0	6	33	9	120	8	65	15	57	0	0	10	238	0	0	14	172	3	44	0	0	-1
907	0	0	3	88	14	86	4	130	0	0	7	152	11	188	0	0	1	156	13	110	12	60	0	0	2	196	8	49	5	95	0	0	-1
907	-1