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	2	3	870	81.66	4248.25	
r_0t	x_ijt	q_it	and_so_on
1740	-1
1740	0	0	26	132	27	148	12	116	7	58	29	61	3	72	1	28	19	30	32	15	5	79	20	61	6	70	0	0	15	15	9	198	8	112	33	146	24	190	34	138	10	44	21	13	0	0	13	12	2	49	14	96	23	170	4	13	17	114	16	96	25	56	22	57	30	47	18	160	0	0	-1
1740	0	0	11	62	22	57	30	94	28	255	35	19	31	111	0	0	-1