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	5	153	12.8	11835.5	
r_0t	x_ijt	q_it	and_so_on
511	0	0	3	12	10	43	2	78	0	0	-1
511	0	0	9	115	7	38	0	0	1	102	4	20	0	0	6	138	0	0	-1
511	0	0	8	153	0	0	5	147	0	0	3	24	10	86	0	0	2	153	0	0	9	153	0	0	-1
511	0	0	4	20	2	81	0	0	1	102	7	38	0	0	5	153	0	0	6	138	0	0	-1
511	0	0	1	51	4	10	2	78	0	0	8	122	0	0	7	19	3	24	10	86	0	0	9	128	0	0	-1
511	0	0	6	69	0	0	-1