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