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	5	334	51.27	9902.07	
r_0t	x_ijt	q_it	and_so_on
1112	-1
1112	0	0	10	84	15	74	14	88	7	42	0	0	3	166	0	0	9	66	5	148	11	92	0	0	18	152	16	77	12	62	0	0	2	166	20	32	8	22	6	69	0	0	-1
1112	0	0	17	126	1	28	13	168	8	11	0	0	16	154	19	180	0	0	10	168	4	162	0	0	11	184	6	138	0	0	-1
1112	0	0	3	166	14	88	7	42	0	0	9	66	5	148	20	32	0	0	2	166	18	143	0	0	-1
1112	0	0	10	168	15	74	7	21	0	0	4	162	13	168	0	0	11	184	6	138	0	0	17	84	19	120	12	62	0	0	16	154	18	85	1	28	8	22	9	33	0	0	-1
1112	-1