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	1	1360	26.3	13483.6	
r_0t	x_ijt	q_it	and_so_on
907	-1
907	0	0	10	180	12	30	1	78	13	110	8	76	15	38	14	119	3	44	4	65	0	0	-1
907	0	0	3	88	14	139	7	171	6	33	11	188	9	141	2	196	8	38	13	55	1	156	12	60	5	95	0	0	-1
907	0	0	10	180	5	285	4	195	0	0	-1
907	0	0	3	88	14	172	7	114	6	22	11	188	9	94	2	196	8	76	15	38	13	110	1	156	12	60	0	0	-1
907	-1