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