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	2	834	66.33	7214.52	
r_0t	x_ijt	q_it	and_so_on
1112	-1
1112	0	0	9	33	11	184	20	32	8	22	1	14	18	152	16	154	19	120	12	62	0	0	6	138	10	168	15	74	14	88	7	42	3	166	0	0	-1
1112	0	0	9	66	4	81	5	222	13	84	2	249	17	126	0	0	-1
1112	0	0	3	166	7	21	15	74	10	84	4	81	11	184	6	69	0	0	8	22	13	252	1	14	17	42	18	76	16	154	19	120	12	62	0	0	-1
1112	0	0	6	138	9	66	10	168	7	42	14	132	0	0	16	77	18	152	1	28	2	166	20	48	8	11	5	74	4	162	11	92	0	0	-1
1112	-1