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	2	20	2	1	1668	37.58	15073.3	
r_0t	x_ijt	q_it	and_so_on
1112	-1
1112	0	0	6	69	16	154	12	62	19	120	18	76	17	84	8	22	20	32	5	148	11	184	9	33	10	168	15	37	14	88	7	42	3	166	0	0	-1
1112	0	0	6	69	9	66	11	92	4	162	13	84	2	249	1	28	18	152	16	77	0	0	-1
1112	0	0	6	69	8	22	13	252	5	148	10	126	15	111	14	88	7	42	3	166	0	0	-1
1112	0	0	10	126	7	21	14	44	12	62	19	180	16	154	18	152	17	126	1	28	2	166	20	48	8	11	4	162	11	184	9	66	6	138	0	0	-1
1112	-1