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	10	4	4	192	12.61	9842.53	
r_0t	x_ijt	q_it	and_so_on
511	-1
511	0	0	7	38	3	24	1	102	0	0	2	156	4	20	0	0	9	105	10	86	0	0	6	138	0	0	-1
511	0	0	8	165	0	0	9	192	0	0	5	150	0	0	-1
511	0	0	7	38	3	24	1	102	0	0	2	156	4	20	0	0	10	86	6	69	0	0	9	99	0	0	-1
511	0	0	6	138	0	0	1	51	3	12	8	110	0	0	10	43	2	78	4	10	0	0	5	150	7	19	0	0	-1
511	-1