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	1	30	4	2	1218	61.28	10051.6	
r_0t	x_ijt	q_it	and_so_on
1624	0	0	4	31	5	73	2	92	27	49	0	0	-1
1624	0	0	20	78	4	31	27	49	24	17	30	158	25	116	8	11	18	64	12	198	28	26	16	128	21	41	5	73	22	70	1	32	3	126	0	0	9	32	23	126	15	168	19	93	10	96	29	198	13	182	11	55	14	53	17	29	26	60	7	20	6	106	0	0	-1
1624	-1