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	5	3	765	64.03	3588.64	
r_0t	x_ijt	q_it	and_so_on
1531	-1
1531	0	0	1	80	26	28	20	24	21	49	22	18	4	28	13	43	29	196	2	90	18	121	5	88	0	0	10	72	7	64	23	32	17	79	15	35	30	192	28	74	11	88	24	128	0	0	6	56	19	92	25	96	16	110	14	42	8	112	9	32	27	28	12	98	3	99	0	0	-1
1531	-1