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	1	1668	35.59	6506.08	
r_0t	x_ijt	q_it	and_so_on
1112	-1
1112	0	0	10	168	15	37	7	42	14	88	12	62	19	120	16	154	18	76	17	84	8	22	5	74	11	184	9	33	6	138	0	0	-1
1112	0	0	9	66	4	162	8	11	20	48	13	168	2	249	1	42	18	152	16	77	3	249	0	0	-1
1112	0	0	3	83	7	42	15	111	10	168	5	222	11	184	6	69	0	0	-1
1112	0	0	10	84	7	21	14	132	12	62	19	120	16	154	18	152	17	99	1	14	2	166	13	168	20	16	8	22	4	162	11	92	9	66	6	138	0	0	-1
1112	-1