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	30	4	3	812	62	4055.9	
r_0t	x_ijt	q_it	and_so_on
1624	-1
1624	0	0	9	32	23	126	30	158	25	116	8	22	18	64	12	198	28	26	4	31	20	39	0	0	24	17	15	168	19	93	10	96	29	198	13	182	11	55	0	0	3	126	6	106	1	16	5	146	21	41	16	128	2	151	27	98	0	0	-1
1624	0	0	14	159	17	87	26	60	7	51	1	32	22	70	4	62	20	39	0	0	-1