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	5	5	3	123	30.52	4062.24	
r_0t	x_ijt	q_it	and_so_on
246	0	0	3	22	4	49.25	0	0	-1
246	0	0	2	113	0	0	4	123	0	0	-1
246	0	0	3	123	0	0	5	36	4	60.75	0	0	1	57	0	0	-1
246	0	0	2	123	0	0	4	123	0	0	-1
246	0	0	3	123	0	0	-1
246	0	0	1	19	4	89	5	12	0	0	-1