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