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