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	2	254	5.91	3932.98	
r_0t	x_ijt	q_it	and_so_on
338	-1
338	0	0	3	150	0	0	5	128	1	103	0	0	-1
338	0	0	2	252	0	0	4	129	0	0	-1
338	0	0	3	96	5	128	0	0	1	157	0	0	-1
338	0	0	3	129	0	0	5	64	2	112	4	76	0	0	-1
338	-1