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	2	20	2	3	556	61.89	7825.58	
r_0t	x_ijt	q_it	and_so_on
1112	-1
1112	0	0	9	33	8	22	1	14	18	152	16	154	19	120	12	31	0	0	6	69	11	184	10	84	15	74	14	88	7	21	0	0	-1
1112	0	0	17	126	2	249	13	84	20	48	0	0	3	249	7	42	10	168	0	0	6	138	11	92	5	179	4	81	9	66	0	0	-1
1112	0	0	17	42	1	42	18	76	16	154	19	120	12	93	0	0	4	243	13	252	20	16	8	22	0	0	-1
1112	0	0	5	150	8	11	2	166	18	152	16	77	0	0	10	168	15	74	14	132	7	42	0	0	3	166	9	66	11	184	6	138	0	0	-1
1112	-1