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