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