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	1	35	1	5	553	86.35	4863.72	
r_0t	x_ijt	q_it	and_so_on
1844	-1
1844	0	0	33	41	20	35	25	38	28	92	1	61	27	174	13	112	0	0	6	134	17	156	16	106	11	72	0	0	5	89	32	114	12	34	26	76	30	106	22	66	31	68	0	0	29	130	3	68	23	94	4	112	35	59	18	90	0	0	2	23	8	33	24	104	34	168	19	12	21	11	10	54	15	20	9	99	14	29	0	0	-1
1844	0	0	7	64	0	0	-1