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