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	1	5	570	60.16	14570.1	
r_0t	x_ijt	q_it	and_so_on
1900	-1
1900	0	0	5	50	10	87	9	166	27	128	16	91	0	0	23	136	28	66	12	192	11	176	0	0	29	198	24	106	6	88	25	178	0	0	14	88	7	56	2	106	26	67	21	34	3	90	13	75	30	54	0	0	15	102	4	164	22	47	17	118	18	60	0	0	-1
1900	0	0	8	55	20	252	1	102	19	53	18	60	0	0	-1