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	1	1	507	5.23	3221.24	
r_0t	x_ijt	q_it	and_so_on
338	-1
338	0	0	1	130	5	128	3	109	0	0	-1
338	0	0	5	64	2	273	4	129	3	41	0	0	-1
338	0	0	3	150	0	0	-1
338	0	0	1	195	5	128	2	98	4	86	0	0	-1
338	0	0	3	75	0	0	-1